/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-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:57:38,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:57:38,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:57:38,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:57:38,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:57:38,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:57:38,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:57:38,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:57:38,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:57:38,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:57:38,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:57:38,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:57:38,234 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:57:38,235 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:57:38,236 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:57:38,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:57:38,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:57:38,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:57:38,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:57:38,243 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:57:38,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:57:38,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:57:38,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:57:38,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:57:38,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:57:38,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:57:38,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:57:38,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:57:38,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:57:38,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:57:38,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:57:38,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:57:38,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:57:38,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:57:38,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:57:38,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:57:38,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:57:38,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:57:38,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:57:38,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:57:38,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:57:38,260 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-SemanticLbe.epf [2020-02-10 19:57:38,274 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:57:38,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:57:38,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:57:38,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:57:38,276 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:57:38,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:57:38,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:57:38,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:57:38,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:57:38,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:57:38,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:57:38,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:57:38,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:57:38,277 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:57:38,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:57:38,278 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:57:38,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:57:38,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:57:38,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:57:38,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:57:38,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:57:38,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:57:38,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:57:38,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:57:38,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:57:38,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:57:38,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:57:38,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:57:38,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:57:38,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:57:38,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:57:38,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:57:38,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:57:38,583 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:57:38,584 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl [2020-02-10 19:57:38,584 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl' [2020-02-10 19:57:38,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:57:38,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:57:38,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:57:38,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:57:38,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:57:38,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:57:38,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:57:38,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:57:38,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:57:38,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/1) ... [2020-02-10 19:57:38,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:57:38,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:57:38,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:57:38,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:57:38,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (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 19:57:38,755 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:57:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:57:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:57:38,756 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:57:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:57:38,757 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:57:38,757 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:57:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:57:38,758 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:57:38,758 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:57:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:57:38,758 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:57:38,759 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:57:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:57:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:57:38,759 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 19:57:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 19:57:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 19:57:38,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:57:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:57:38,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:57:38,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:57:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:57:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:57:38,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:57:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:57:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:57:38,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:57:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:57:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:57:38,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 19:57:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 19:57:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 19:57:38,764 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 19:57:39,027 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:57:39,028 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:57:39,047 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:57:39 BoogieIcfgContainer [2020-02-10 19:57:39,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:57:39,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:57:39,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:57:39,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:57:39,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:57:38" (1/2) ... [2020-02-10 19:57:39,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@199f3c45 and model type example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:57:39, skipping insertion in model container [2020-02-10 19:57:39,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:57:39" (2/2) ... [2020-02-10 19:57:39,067 INFO L109 eAbstractionObserver]: Analyzing ICFG example_10.bpl [2020-02-10 19:57:39,081 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:57:39,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:57:39,091 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:57:39,092 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:57:39,340 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-02-10 19:57:39,359 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:57:39,359 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:57:39,359 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:57:39,359 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:57:39,360 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:57:39,360 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:57:39,360 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:57:39,360 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:57:39,377 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 143 transitions [2020-02-10 19:57:39,380 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 19:57:42,859 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 19:57:42,859 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 19:57:42,933 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-02-10 19:57:43,047 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 19:57:46,470 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 19:57:46,470 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 19:57:46,508 INFO L76 FinitePrefix]: Finished finitePrefix Result has 10304 conditions, 5153 events. 4097/5153 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 20915 event pairs. 0/5152 useless extension candidates. Maximal degree in co-relation 4655. Up to 1260 conditions per place. [2020-02-10 19:57:46,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3780 [2020-02-10 19:57:46,609 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:57:46,888 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1035 [2020-02-10 19:57:46,889 INFO L214 etLargeBlockEncoding]: Total number of compositions: 11 [2020-02-10 19:57:46,892 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 132 transitions [2020-02-10 19:58:00,993 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60074 states. [2020-02-10 19:58:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 60074 states. [2020-02-10 19:58:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:01,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:01,345 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash 661896340, now seen corresponding path program 1 times [2020-02-10 19:58:01,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:01,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184305986] [2020-02-10 19:58:01,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:01,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184305986] [2020-02-10 19:58:01,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:01,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:01,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657908745] [2020-02-10 19:58:01,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:01,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:01,566 INFO L87 Difference]: Start difference. First operand 60074 states. Second operand 3 states. [2020-02-10 19:58:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:02,439 INFO L93 Difference]: Finished difference Result 59562 states and 393662 transitions. [2020-02-10 19:58:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:02,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:05,192 INFO L225 Difference]: With dead ends: 59562 [2020-02-10 19:58:05,193 INFO L226 Difference]: Without dead ends: 59561 [2020-02-10 19:58:05,194 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 19:58:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2020-02-10 19:58:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 59561. [2020-02-10 19:58:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59561 states. [2020-02-10 19:58:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59561 states to 59561 states and 393661 transitions. [2020-02-10 19:58:10,273 INFO L78 Accepts]: Start accepts. Automaton has 59561 states and 393661 transitions. Word has length 31 [2020-02-10 19:58:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:10,274 INFO L479 AbstractCegarLoop]: Abstraction has 59561 states and 393661 transitions. [2020-02-10 19:58:10,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 59561 states and 393661 transitions. [2020-02-10 19:58:10,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:10,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:10,500 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 426637814, now seen corresponding path program 1 times [2020-02-10 19:58:10,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:10,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064275299] [2020-02-10 19:58:10,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:10,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 19:58:10,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064275299] [2020-02-10 19:58:10,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:10,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:10,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383304515] [2020-02-10 19:58:10,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:10,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:10,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:10,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:10,545 INFO L87 Difference]: Start difference. First operand 59561 states and 393661 transitions. Second operand 3 states. [2020-02-10 19:58:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:14,189 INFO L93 Difference]: Finished difference Result 46761 states and 293565 transitions. [2020-02-10 19:58:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:14,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:14,389 INFO L225 Difference]: With dead ends: 46761 [2020-02-10 19:58:14,389 INFO L226 Difference]: Without dead ends: 46761 [2020-02-10 19:58:14,390 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 19:58:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46761 states. [2020-02-10 19:58:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46761 to 46761. [2020-02-10 19:58:17,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46761 states. [2020-02-10 19:58:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46761 states to 46761 states and 293565 transitions. [2020-02-10 19:58:17,774 INFO L78 Accepts]: Start accepts. Automaton has 46761 states and 293565 transitions. Word has length 31 [2020-02-10 19:58:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:17,775 INFO L479 AbstractCegarLoop]: Abstraction has 46761 states and 293565 transitions. [2020-02-10 19:58:17,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 46761 states and 293565 transitions. [2020-02-10 19:58:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:17,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:17,876 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:17,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1161690204, now seen corresponding path program 1 times [2020-02-10 19:58:17,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:17,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964256453] [2020-02-10 19:58:17,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:17,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964256453] [2020-02-10 19:58:17,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:17,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:17,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933450636] [2020-02-10 19:58:17,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:17,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:17,929 INFO L87 Difference]: Start difference. First operand 46761 states and 293565 transitions. Second operand 3 states. [2020-02-10 19:58:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:18,244 INFO L93 Difference]: Finished difference Result 44201 states and 271549 transitions. [2020-02-10 19:58:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:18,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:18,499 INFO L225 Difference]: With dead ends: 44201 [2020-02-10 19:58:18,500 INFO L226 Difference]: Without dead ends: 44201 [2020-02-10 19:58:18,500 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 19:58:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44201 states. [2020-02-10 19:58:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44201 to 44201. [2020-02-10 19:58:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44201 states. [2020-02-10 19:58:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44201 states to 44201 states and 271549 transitions. [2020-02-10 19:58:24,248 INFO L78 Accepts]: Start accepts. Automaton has 44201 states and 271549 transitions. Word has length 31 [2020-02-10 19:58:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:24,248 INFO L479 AbstractCegarLoop]: Abstraction has 44201 states and 271549 transitions. [2020-02-10 19:58:24,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44201 states and 271549 transitions. [2020-02-10 19:58:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:24,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:24,363 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:24,363 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 852645084, now seen corresponding path program 1 times [2020-02-10 19:58:24,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:24,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132535420] [2020-02-10 19:58:24,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:24,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 19:58:24,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132535420] [2020-02-10 19:58:24,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:24,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:24,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030946869] [2020-02-10 19:58:24,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:24,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:24,400 INFO L87 Difference]: Start difference. First operand 44201 states and 271549 transitions. Second operand 3 states. [2020-02-10 19:58:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:24,632 INFO L93 Difference]: Finished difference Result 38313 states and 225981 transitions. [2020-02-10 19:58:24,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:24,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:24,786 INFO L225 Difference]: With dead ends: 38313 [2020-02-10 19:58:24,786 INFO L226 Difference]: Without dead ends: 38313 [2020-02-10 19:58:24,787 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 19:58:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38313 states. [2020-02-10 19:58:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38313 to 38313. [2020-02-10 19:58:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38313 states. [2020-02-10 19:58:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38313 states to 38313 states and 225981 transitions. [2020-02-10 19:58:27,506 INFO L78 Accepts]: Start accepts. Automaton has 38313 states and 225981 transitions. Word has length 31 [2020-02-10 19:58:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:27,506 INFO L479 AbstractCegarLoop]: Abstraction has 38313 states and 225981 transitions. [2020-02-10 19:58:27,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 38313 states and 225981 transitions. [2020-02-10 19:58:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:27,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:27,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:27,585 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash 567479930, now seen corresponding path program 1 times [2020-02-10 19:58:27,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:27,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162168813] [2020-02-10 19:58:27,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:27,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162168813] [2020-02-10 19:58:27,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:27,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:27,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383298622] [2020-02-10 19:58:27,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:27,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:27,623 INFO L87 Difference]: Start difference. First operand 38313 states and 225981 transitions. Second operand 3 states. [2020-02-10 19:58:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:27,791 INFO L93 Difference]: Finished difference Result 25961 states and 144061 transitions. [2020-02-10 19:58:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:27,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:27,867 INFO L225 Difference]: With dead ends: 25961 [2020-02-10 19:58:27,868 INFO L226 Difference]: Without dead ends: 25961 [2020-02-10 19:58:27,868 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 19:58:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2020-02-10 19:58:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 25961. [2020-02-10 19:58:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25961 states. [2020-02-10 19:58:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25961 states to 25961 states and 144061 transitions. [2020-02-10 19:58:29,037 INFO L78 Accepts]: Start accepts. Automaton has 25961 states and 144061 transitions. Word has length 31 [2020-02-10 19:58:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:29,037 INFO L479 AbstractCegarLoop]: Abstraction has 25961 states and 144061 transitions. [2020-02-10 19:58:29,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25961 states and 144061 transitions. [2020-02-10 19:58:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:29,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:29,992 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1677176002, now seen corresponding path program 1 times [2020-02-10 19:58:29,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:29,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588562520] [2020-02-10 19:58:29,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:30,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 19:58:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588562520] [2020-02-10 19:58:30,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:30,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:30,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975803019] [2020-02-10 19:58:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:30,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:30,024 INFO L87 Difference]: Start difference. First operand 25961 states and 144061 transitions. Second operand 3 states. [2020-02-10 19:58:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:30,160 INFO L93 Difference]: Finished difference Result 15753 states and 82941 transitions. [2020-02-10 19:58:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:30,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:30,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:30,207 INFO L225 Difference]: With dead ends: 15753 [2020-02-10 19:58:30,207 INFO L226 Difference]: Without dead ends: 15753 [2020-02-10 19:58:30,207 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 19:58:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15753 states. [2020-02-10 19:58:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15753 to 15753. [2020-02-10 19:58:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15753 states. [2020-02-10 19:58:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15753 states to 15753 states and 82941 transitions. [2020-02-10 19:58:30,849 INFO L78 Accepts]: Start accepts. Automaton has 15753 states and 82941 transitions. Word has length 31 [2020-02-10 19:58:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:30,849 INFO L479 AbstractCegarLoop]: Abstraction has 15753 states and 82941 transitions. [2020-02-10 19:58:30,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 15753 states and 82941 transitions. [2020-02-10 19:58:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:30,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:30,877 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579948, now seen corresponding path program 1 times [2020-02-10 19:58:30,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:30,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369873749] [2020-02-10 19:58:30,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:30,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369873749] [2020-02-10 19:58:30,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:30,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:30,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324216066] [2020-02-10 19:58:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:30,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:30,917 INFO L87 Difference]: Start difference. First operand 15753 states and 82941 transitions. Second operand 3 states. [2020-02-10 19:58:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:30,992 INFO L93 Difference]: Finished difference Result 8825 states and 45229 transitions. [2020-02-10 19:58:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:30,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:31,025 INFO L225 Difference]: With dead ends: 8825 [2020-02-10 19:58:31,025 INFO L226 Difference]: Without dead ends: 8825 [2020-02-10 19:58:31,027 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 19:58:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2020-02-10 19:58:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8825. [2020-02-10 19:58:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8825 states. [2020-02-10 19:58:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8825 states to 8825 states and 45229 transitions. [2020-02-10 19:58:31,418 INFO L78 Accepts]: Start accepts. Automaton has 8825 states and 45229 transitions. Word has length 31 [2020-02-10 19:58:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:31,418 INFO L479 AbstractCegarLoop]: Abstraction has 8825 states and 45229 transitions. [2020-02-10 19:58:31,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8825 states and 45229 transitions. [2020-02-10 19:58:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:31,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:31,434 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:31,435 INFO L82 PathProgramCache]: Analyzing trace with hash 982570830, now seen corresponding path program 1 times [2020-02-10 19:58:31,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:31,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098157867] [2020-02-10 19:58:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:31,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 19:58:31,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098157867] [2020-02-10 19:58:31,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:31,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:31,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158295066] [2020-02-10 19:58:31,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:31,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:31,469 INFO L87 Difference]: Start difference. First operand 8825 states and 45229 transitions. Second operand 3 states. [2020-02-10 19:58:31,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:31,511 INFO L93 Difference]: Finished difference Result 5097 states and 25581 transitions. [2020-02-10 19:58:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:31,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:31,526 INFO L225 Difference]: With dead ends: 5097 [2020-02-10 19:58:31,526 INFO L226 Difference]: Without dead ends: 5097 [2020-02-10 19:58:31,527 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 19:58:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2020-02-10 19:58:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5097. [2020-02-10 19:58:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5097 states. [2020-02-10 19:58:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 25581 transitions. [2020-02-10 19:58:31,775 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 25581 transitions. Word has length 31 [2020-02-10 19:58:31,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:31,775 INFO L479 AbstractCegarLoop]: Abstraction has 5097 states and 25581 transitions. [2020-02-10 19:58:31,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 25581 transitions. [2020-02-10 19:58:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:31,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:31,785 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:31,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1054359614, now seen corresponding path program 1 times [2020-02-10 19:58:31,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:31,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485022578] [2020-02-10 19:58:31,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:31,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485022578] [2020-02-10 19:58:31,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:31,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:58:31,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262873260] [2020-02-10 19:58:31,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:58:31,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:31,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:58:31,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:58:31,822 INFO L87 Difference]: Start difference. First operand 5097 states and 25581 transitions. Second operand 3 states. [2020-02-10 19:58:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:31,852 INFO L93 Difference]: Finished difference Result 3071 states and 15361 transitions. [2020-02-10 19:58:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:58:31,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 19:58:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:31,862 INFO L225 Difference]: With dead ends: 3071 [2020-02-10 19:58:31,862 INFO L226 Difference]: Without dead ends: 3071 [2020-02-10 19:58:31,862 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 19:58:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2020-02-10 19:58:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2020-02-10 19:58:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2020-02-10 19:58:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 15361 transitions. [2020-02-10 19:58:32,033 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 15361 transitions. Word has length 31 [2020-02-10 19:58:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:32,034 INFO L479 AbstractCegarLoop]: Abstraction has 3071 states and 15361 transitions. [2020-02-10 19:58:32,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:58:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 15361 transitions. [2020-02-10 19:58:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:32,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:32,041 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:32,042 INFO L82 PathProgramCache]: Analyzing trace with hash -605876662, now seen corresponding path program 1 times [2020-02-10 19:58:32,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:32,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615505679] [2020-02-10 19:58:32,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:32,768 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:58:33,206 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:58:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:33,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615505679] [2020-02-10 19:58:33,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:33,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:33,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190128557] [2020-02-10 19:58:33,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:33,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:33,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:33,228 INFO L87 Difference]: Start difference. First operand 3071 states and 15361 transitions. Second operand 12 states. [2020-02-10 19:58:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:33,551 INFO L93 Difference]: Finished difference Result 6095 states and 27102 transitions. [2020-02-10 19:58:33,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:33,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:33,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:33,569 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 19:58:33,569 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:58:33,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:58:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3141. [2020-02-10 19:58:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:58:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15673 transitions. [2020-02-10 19:58:33,809 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15673 transitions. Word has length 31 [2020-02-10 19:58:33,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:33,810 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15673 transitions. [2020-02-10 19:58:33,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15673 transitions. [2020-02-10 19:58:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:33,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:33,817 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1873333840, now seen corresponding path program 2 times [2020-02-10 19:58:33,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:33,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082927043] [2020-02-10 19:58:33,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:35,524 WARN L192 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:58:35,666 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:58:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:35,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082927043] [2020-02-10 19:58:35,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:35,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:35,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474594747] [2020-02-10 19:58:35,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:35,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:35,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:35,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:35,679 INFO L87 Difference]: Start difference. First operand 3141 states and 15673 transitions. Second operand 12 states. [2020-02-10 19:58:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:36,060 INFO L93 Difference]: Finished difference Result 6096 states and 27096 transitions. [2020-02-10 19:58:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:36,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:36,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:36,076 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:58:36,076 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 19:58:36,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 19:58:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3133. [2020-02-10 19:58:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:58:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15651 transitions. [2020-02-10 19:58:36,304 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15651 transitions. Word has length 31 [2020-02-10 19:58:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:36,304 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15651 transitions. [2020-02-10 19:58:36,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15651 transitions. [2020-02-10 19:58:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:36,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:36,312 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:36,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1454499134, now seen corresponding path program 3 times [2020-02-10 19:58:36,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:36,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467240488] [2020-02-10 19:58:36,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:36,954 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:58:37,109 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:58:37,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 19:58:37,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467240488] [2020-02-10 19:58:37,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:37,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:37,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905970688] [2020-02-10 19:58:37,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:37,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:37,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:37,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:37,125 INFO L87 Difference]: Start difference. First operand 3133 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:58:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:37,405 INFO L93 Difference]: Finished difference Result 6092 states and 27088 transitions. [2020-02-10 19:58:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:37,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:37,424 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:58:37,424 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 19:58:37,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 19:58:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3140. [2020-02-10 19:58:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:58:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15664 transitions. [2020-02-10 19:58:37,660 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15664 transitions. Word has length 31 [2020-02-10 19:58:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:37,661 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15664 transitions. [2020-02-10 19:58:37,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15664 transitions. [2020-02-10 19:58:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:37,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:37,668 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:37,669 INFO L82 PathProgramCache]: Analyzing trace with hash -116931920, now seen corresponding path program 4 times [2020-02-10 19:58:37,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:37,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768216831] [2020-02-10 19:58:37,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:38,239 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:58:38,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 19:58:38,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768216831] [2020-02-10 19:58:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:38,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:38,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364224584] [2020-02-10 19:58:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:38,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:38,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:38,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:38,388 INFO L87 Difference]: Start difference. First operand 3140 states and 15664 transitions. Second operand 12 states. [2020-02-10 19:58:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:38,650 INFO L93 Difference]: Finished difference Result 6091 states and 27079 transitions. [2020-02-10 19:58:38,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:38,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:38,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:38,668 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 19:58:38,668 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 19:58:38,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 19:58:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3133. [2020-02-10 19:58:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:58:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15644 transitions. [2020-02-10 19:58:38,958 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15644 transitions. Word has length 31 [2020-02-10 19:58:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:38,958 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15644 transitions. [2020-02-10 19:58:38,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15644 transitions. [2020-02-10 19:58:38,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:38,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:38,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:38,964 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:38,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:38,964 INFO L82 PathProgramCache]: Analyzing trace with hash 936544130, now seen corresponding path program 5 times [2020-02-10 19:58:38,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:38,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189649725] [2020-02-10 19:58:38,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:39,566 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:39,704 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:39,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189649725] [2020-02-10 19:58:39,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:39,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:39,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082820999] [2020-02-10 19:58:39,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:39,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:39,716 INFO L87 Difference]: Start difference. First operand 3133 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:58:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:40,007 INFO L93 Difference]: Finished difference Result 6094 states and 27085 transitions. [2020-02-10 19:58:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:40,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:40,025 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 19:58:40,026 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 19:58:40,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 19:58:40,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3140. [2020-02-10 19:58:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:58:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15657 transitions. [2020-02-10 19:58:40,250 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15657 transitions. Word has length 31 [2020-02-10 19:58:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:40,250 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15657 transitions. [2020-02-10 19:58:40,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15657 transitions. [2020-02-10 19:58:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:40,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:40,256 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash -753398774, now seen corresponding path program 6 times [2020-02-10 19:58:40,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:40,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102194895] [2020-02-10 19:58:40,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:40,865 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:41,008 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:41,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 19:58:41,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102194895] [2020-02-10 19:58:41,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:41,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:41,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443722334] [2020-02-10 19:58:41,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:41,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:41,019 INFO L87 Difference]: Start difference. First operand 3140 states and 15657 transitions. Second operand 12 states. [2020-02-10 19:58:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:41,345 INFO L93 Difference]: Finished difference Result 6092 states and 27074 transitions. [2020-02-10 19:58:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:41,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:41,361 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 19:58:41,362 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 19:58:41,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 19:58:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3126. [2020-02-10 19:58:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:58:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15624 transitions. [2020-02-10 19:58:41,619 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15624 transitions. Word has length 31 [2020-02-10 19:58:41,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:41,619 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15624 transitions. [2020-02-10 19:58:41,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15624 transitions. [2020-02-10 19:58:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:41,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:41,625 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:41,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1138487344, now seen corresponding path program 7 times [2020-02-10 19:58:41,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:41,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813453966] [2020-02-10 19:58:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:42,416 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:58:42,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 19:58:42,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813453966] [2020-02-10 19:58:42,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:42,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:42,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422048580] [2020-02-10 19:58:42,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:42,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:42,430 INFO L87 Difference]: Start difference. First operand 3126 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:58:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:42,684 INFO L93 Difference]: Finished difference Result 6109 states and 27126 transitions. [2020-02-10 19:58:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:42,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:42,704 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 19:58:42,704 INFO L226 Difference]: Without dead ends: 6090 [2020-02-10 19:58:42,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2020-02-10 19:58:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 3145. [2020-02-10 19:58:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2020-02-10 19:58:42,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 15676 transitions. [2020-02-10 19:58:42,970 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 15676 transitions. Word has length 31 [2020-02-10 19:58:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:42,970 INFO L479 AbstractCegarLoop]: Abstraction has 3145 states and 15676 transitions. [2020-02-10 19:58:42,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 15676 transitions. [2020-02-10 19:58:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:42,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:42,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:42,976 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -128969834, now seen corresponding path program 8 times [2020-02-10 19:58:42,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:42,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728899786] [2020-02-10 19:58:42,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:43,599 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:58:43,740 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:58:43,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 19:58:43,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728899786] [2020-02-10 19:58:43,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:43,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:43,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794371272] [2020-02-10 19:58:43,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:43,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:43,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:43,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:43,754 INFO L87 Difference]: Start difference. First operand 3145 states and 15676 transitions. Second operand 12 states. [2020-02-10 19:58:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:43,986 INFO L93 Difference]: Finished difference Result 6110 states and 27120 transitions. [2020-02-10 19:58:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:43,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:44,003 INFO L225 Difference]: With dead ends: 6110 [2020-02-10 19:58:44,003 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 19:58:44,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 19:58:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3137. [2020-02-10 19:58:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:58:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15653 transitions. [2020-02-10 19:58:44,207 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15653 transitions. Word has length 31 [2020-02-10 19:58:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:44,207 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15653 transitions. [2020-02-10 19:58:44,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15653 transitions. [2020-02-10 19:58:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:44,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:44,213 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -346601982, now seen corresponding path program 9 times [2020-02-10 19:58:44,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:44,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211827148] [2020-02-10 19:58:44,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:44,793 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:44,923 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:58:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:44,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211827148] [2020-02-10 19:58:44,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:44,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:44,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903372507] [2020-02-10 19:58:44,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:44,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:44,935 INFO L87 Difference]: Start difference. First operand 3137 states and 15653 transitions. Second operand 12 states. [2020-02-10 19:58:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:45,223 INFO L93 Difference]: Finished difference Result 6112 states and 27123 transitions. [2020-02-10 19:58:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:45,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:45,239 INFO L225 Difference]: With dead ends: 6112 [2020-02-10 19:58:45,239 INFO L226 Difference]: Without dead ends: 6093 [2020-02-10 19:58:45,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2020-02-10 19:58:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3146. [2020-02-10 19:58:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:58:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15670 transitions. [2020-02-10 19:58:45,446 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15670 transitions. Word has length 31 [2020-02-10 19:58:45,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:45,447 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15670 transitions. [2020-02-10 19:58:45,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15670 transitions. [2020-02-10 19:58:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:45,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:45,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:45,452 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -276491946, now seen corresponding path program 10 times [2020-02-10 19:58:45,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:45,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693789359] [2020-02-10 19:58:45,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:45,939 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:58:46,095 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 19:58:46,222 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:58:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:46,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693789359] [2020-02-10 19:58:46,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:46,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:46,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779029092] [2020-02-10 19:58:46,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:46,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:46,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:46,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:46,237 INFO L87 Difference]: Start difference. First operand 3146 states and 15670 transitions. Second operand 12 states. [2020-02-10 19:58:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:46,452 INFO L93 Difference]: Finished difference Result 6115 states and 27120 transitions. [2020-02-10 19:58:46,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:46,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:46,468 INFO L225 Difference]: With dead ends: 6115 [2020-02-10 19:58:46,469 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:58:46,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:46,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:58:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3137. [2020-02-10 19:58:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:58:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15644 transitions. [2020-02-10 19:58:46,675 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15644 transitions. Word has length 31 [2020-02-10 19:58:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:46,675 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15644 transitions. [2020-02-10 19:58:46,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15644 transitions. [2020-02-10 19:58:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:46,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:46,681 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2044441282, now seen corresponding path program 11 times [2020-02-10 19:58:46,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:46,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877757505] [2020-02-10 19:58:46,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:47,292 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:58:47,439 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:58:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:47,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877757505] [2020-02-10 19:58:47,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:47,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:47,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190471624] [2020-02-10 19:58:47,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:47,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:47,453 INFO L87 Difference]: Start difference. First operand 3137 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:58:47,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:47,755 INFO L93 Difference]: Finished difference Result 6116 states and 27122 transitions. [2020-02-10 19:58:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:47,756 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:47,771 INFO L225 Difference]: With dead ends: 6116 [2020-02-10 19:58:47,772 INFO L226 Difference]: Without dead ends: 6096 [2020-02-10 19:58:47,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2020-02-10 19:58:47,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 3148. [2020-02-10 19:58:47,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2020-02-10 19:58:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 15664 transitions. [2020-02-10 19:58:47,980 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 15664 transitions. Word has length 31 [2020-02-10 19:58:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:47,980 INFO L479 AbstractCegarLoop]: Abstraction has 3148 states and 15664 transitions. [2020-02-10 19:58:47,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 15664 transitions. [2020-02-10 19:58:47,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:47,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:47,986 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash -912958800, now seen corresponding path program 12 times [2020-02-10 19:58:47,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:47,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823150255] [2020-02-10 19:58:47,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:48,603 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:58:48,735 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 19:58:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:48,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823150255] [2020-02-10 19:58:48,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:48,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:48,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44138339] [2020-02-10 19:58:48,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:48,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:48,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:48,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:48,746 INFO L87 Difference]: Start difference. First operand 3148 states and 15664 transitions. Second operand 12 states. [2020-02-10 19:58:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:49,108 INFO L93 Difference]: Finished difference Result 6118 states and 27116 transitions. [2020-02-10 19:58:49,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:49,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:49,123 INFO L225 Difference]: With dead ends: 6118 [2020-02-10 19:58:49,124 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 19:58:49,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 19:58:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3126. [2020-02-10 19:58:49,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:58:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15614 transitions. [2020-02-10 19:58:49,331 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15614 transitions. Word has length 31 [2020-02-10 19:58:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:49,331 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15614 transitions. [2020-02-10 19:58:49,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15614 transitions. [2020-02-10 19:58:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:49,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:49,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:49,338 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash -247627984, now seen corresponding path program 13 times [2020-02-10 19:58:49,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:49,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206666029] [2020-02-10 19:58:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:49,929 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:50,063 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:58:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:50,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206666029] [2020-02-10 19:58:50,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:50,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:50,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853309930] [2020-02-10 19:58:50,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:50,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:50,075 INFO L87 Difference]: Start difference. First operand 3126 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:58:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:50,460 INFO L93 Difference]: Finished difference Result 6097 states and 27088 transitions. [2020-02-10 19:58:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:50,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:50,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:50,477 INFO L225 Difference]: With dead ends: 6097 [2020-02-10 19:58:50,477 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 19:58:50,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 19:58:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3141. [2020-02-10 19:58:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 19:58:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15657 transitions. [2020-02-10 19:58:50,684 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15657 transitions. Word has length 31 [2020-02-10 19:58:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:50,685 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15657 transitions. [2020-02-10 19:58:50,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15657 transitions. [2020-02-10 19:58:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:50,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:50,690 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1089939230, now seen corresponding path program 14 times [2020-02-10 19:58:50,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:50,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359231759] [2020-02-10 19:58:50,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:51,299 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:58:51,436 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:58:51,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359231759] [2020-02-10 19:58:51,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:51,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:51,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800158224] [2020-02-10 19:58:51,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:51,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:51,449 INFO L87 Difference]: Start difference. First operand 3141 states and 15657 transitions. Second operand 12 states. [2020-02-10 19:58:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:51,798 INFO L93 Difference]: Finished difference Result 6096 states and 27079 transitions. [2020-02-10 19:58:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:51,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:51,812 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 19:58:51,813 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:58:51,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:51,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:58:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3134. [2020-02-10 19:58:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:58:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15637 transitions. [2020-02-10 19:58:52,021 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15637 transitions. Word has length 31 [2020-02-10 19:58:52,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:52,021 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15637 transitions. [2020-02-10 19:58:52,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:52,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15637 transitions. [2020-02-10 19:58:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:52,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:52,027 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash -884094838, now seen corresponding path program 15 times [2020-02-10 19:58:52,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:52,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378460632] [2020-02-10 19:58:52,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:52,632 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:52,768 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:58:52,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 19:58:52,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378460632] [2020-02-10 19:58:52,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:52,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:52,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421091372] [2020-02-10 19:58:52,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:52,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:52,780 INFO L87 Difference]: Start difference. First operand 3134 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:58:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:53,075 INFO L93 Difference]: Finished difference Result 6103 states and 27093 transitions. [2020-02-10 19:58:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:53,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:53,090 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:58:53,091 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:58:53,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:58:53,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3143. [2020-02-10 19:58:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:58:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15654 transitions. [2020-02-10 19:58:53,294 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15654 transitions. Word has length 31 [2020-02-10 19:58:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:53,294 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15654 transitions. [2020-02-10 19:58:53,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15654 transitions. [2020-02-10 19:58:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:53,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:53,302 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:53,302 INFO L82 PathProgramCache]: Analyzing trace with hash -813984802, now seen corresponding path program 16 times [2020-02-10 19:58:53,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:53,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293967036] [2020-02-10 19:58:53,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:53,957 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 19:58:54,096 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:58:54,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 19:58:54,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293967036] [2020-02-10 19:58:54,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:54,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:54,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925417017] [2020-02-10 19:58:54,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:54,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:54,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:54,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:54,107 INFO L87 Difference]: Start difference. First operand 3143 states and 15654 transitions. Second operand 12 states. [2020-02-10 19:58:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:54,339 INFO L93 Difference]: Finished difference Result 6106 states and 27090 transitions. [2020-02-10 19:58:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:54,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:54,355 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 19:58:54,355 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 19:58:54,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:54,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 19:58:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3134. [2020-02-10 19:58:54,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:58:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 19:58:54,569 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 19:58:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:54,569 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 19:58:54,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 19:58:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:54,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:54,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:54,575 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:54,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1031616950, now seen corresponding path program 17 times [2020-02-10 19:58:54,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:54,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486119533] [2020-02-10 19:58:54,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:55,142 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:58:55,275 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:55,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 19:58:55,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486119533] [2020-02-10 19:58:55,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:55,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:55,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883915678] [2020-02-10 19:58:55,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:55,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:55,287 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 19:58:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:55,511 INFO L93 Difference]: Finished difference Result 6100 states and 27078 transitions. [2020-02-10 19:58:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:55,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:55,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:55,526 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:58:55,526 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 19:58:55,527 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 19:58:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3142. [2020-02-10 19:58:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:58:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15644 transitions. [2020-02-10 19:58:55,730 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15644 transitions. Word has length 31 [2020-02-10 19:58:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:55,730 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15644 transitions. [2020-02-10 19:58:55,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15644 transitions. [2020-02-10 19:58:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:55,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:55,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:55,736 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:55,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1995893168, now seen corresponding path program 18 times [2020-02-10 19:58:55,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:55,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840214680] [2020-02-10 19:58:55,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:56,325 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 19:58:56,455 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:56,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 19:58:56,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840214680] [2020-02-10 19:58:56,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:56,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:56,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553180082] [2020-02-10 19:58:56,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:56,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:56,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:56,467 INFO L87 Difference]: Start difference. First operand 3142 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:58:56,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:56,650 INFO L93 Difference]: Finished difference Result 6104 states and 27078 transitions. [2020-02-10 19:58:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:56,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:56,665 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 19:58:56,665 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 19:58:56,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 19:58:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3126. [2020-02-10 19:58:56,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 19:58:56,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15606 transitions. [2020-02-10 19:58:56,881 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15606 transitions. Word has length 31 [2020-02-10 19:58:56,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:56,881 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15606 transitions. [2020-02-10 19:58:56,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:56,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15606 transitions. [2020-02-10 19:58:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:56,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:56,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:56,888 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:56,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -407188010, now seen corresponding path program 19 times [2020-02-10 19:58:56,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:56,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168476505] [2020-02-10 19:58:56,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:57,468 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:58:57,601 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:57,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 19:58:57,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168476505] [2020-02-10 19:58:57,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:57,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:57,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875782977] [2020-02-10 19:58:57,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:57,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:57,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:57,613 INFO L87 Difference]: Start difference. First operand 3126 states and 15606 transitions. Second operand 12 states. [2020-02-10 19:58:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:57,842 INFO L93 Difference]: Finished difference Result 6103 states and 27092 transitions. [2020-02-10 19:58:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:57,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:57,858 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:58:57,858 INFO L226 Difference]: Without dead ends: 6083 [2020-02-10 19:58:57,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2020-02-10 19:58:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 3142. [2020-02-10 19:58:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 19:58:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15651 transitions. [2020-02-10 19:58:58,066 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15651 transitions. Word has length 31 [2020-02-10 19:58:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:58,066 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15651 transitions. [2020-02-10 19:58:58,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15651 transitions. [2020-02-10 19:58:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:58,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:58,072 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:58,072 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2097130914, now seen corresponding path program 20 times [2020-02-10 19:58:58,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:58,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007044138] [2020-02-10 19:58:58,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:58,902 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:58:58,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 19:58:58,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007044138] [2020-02-10 19:58:58,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:58:58,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:58:58,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001572352] [2020-02-10 19:58:58,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:58:58,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:58:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:58:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:58:58,916 INFO L87 Difference]: Start difference. First operand 3142 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:58:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:58:59,136 INFO L93 Difference]: Finished difference Result 6101 states and 27081 transitions. [2020-02-10 19:58:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:58:59,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:58:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:58:59,152 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 19:58:59,152 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 19:58:59,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:58:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 19:58:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3135. [2020-02-10 19:58:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:58:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15631 transitions. [2020-02-10 19:58:59,402 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15631 transitions. Word has length 31 [2020-02-10 19:58:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:58:59,402 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15631 transitions. [2020-02-10 19:58:59,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:58:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15631 transitions. [2020-02-10 19:58:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:58:59,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:58:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:58:59,408 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:58:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:58:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1043654864, now seen corresponding path program 21 times [2020-02-10 19:58:59,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:58:59,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526760423] [2020-02-10 19:58:59,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:58:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:58:59,991 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:00,119 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:00,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 19:59:00,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526760423] [2020-02-10 19:59:00,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:00,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:00,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813527532] [2020-02-10 19:59:00,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:00,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:00,130 INFO L87 Difference]: Start difference. First operand 3135 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:59:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:00,364 INFO L93 Difference]: Finished difference Result 6111 states and 27101 transitions. [2020-02-10 19:59:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:00,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:00,382 INFO L225 Difference]: With dead ends: 6111 [2020-02-10 19:59:00,383 INFO L226 Difference]: Without dead ends: 6091 [2020-02-10 19:59:00,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2020-02-10 19:59:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3146. [2020-02-10 19:59:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:59:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15651 transitions. [2020-02-10 19:59:00,667 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15651 transitions. Word has length 31 [2020-02-10 19:59:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:00,667 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15651 transitions. [2020-02-10 19:59:00,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15651 transitions. [2020-02-10 19:59:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:00,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:00,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:00,672 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:00,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash 293912350, now seen corresponding path program 22 times [2020-02-10 19:59:00,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:00,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550644749] [2020-02-10 19:59:00,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:01,298 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:59:01,428 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:59:01,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 19:59:01,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550644749] [2020-02-10 19:59:01,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:01,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:01,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986398912] [2020-02-10 19:59:01,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:01,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:01,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:01,439 INFO L87 Difference]: Start difference. First operand 3146 states and 15651 transitions. Second operand 12 states. [2020-02-10 19:59:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:01,626 INFO L93 Difference]: Finished difference Result 6113 states and 27095 transitions. [2020-02-10 19:59:01,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:01,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:01,639 INFO L225 Difference]: With dead ends: 6113 [2020-02-10 19:59:01,640 INFO L226 Difference]: Without dead ends: 6080 [2020-02-10 19:59:01,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2020-02-10 19:59:01,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 3135. [2020-02-10 19:59:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15622 transitions. [2020-02-10 19:59:01,843 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15622 transitions. Word has length 31 [2020-02-10 19:59:01,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:01,843 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15622 transitions. [2020-02-10 19:59:01,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:01,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15622 transitions. [2020-02-10 19:59:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:01,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:01,849 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash 712747056, now seen corresponding path program 23 times [2020-02-10 19:59:01,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:01,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345054570] [2020-02-10 19:59:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:02,547 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:59:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:02,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345054570] [2020-02-10 19:59:02,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:02,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:02,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529487420] [2020-02-10 19:59:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:02,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:02,558 INFO L87 Difference]: Start difference. First operand 3135 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:59:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:02,790 INFO L93 Difference]: Finished difference Result 6104 states and 27077 transitions. [2020-02-10 19:59:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:02,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:02,806 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 19:59:02,807 INFO L226 Difference]: Without dead ends: 6086 [2020-02-10 19:59:02,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2020-02-10 19:59:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 3143. [2020-02-10 19:59:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:59:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15637 transitions. [2020-02-10 19:59:03,014 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15637 transitions. Word has length 31 [2020-02-10 19:59:03,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:03,014 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15637 transitions. [2020-02-10 19:59:03,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15637 transitions. [2020-02-10 19:59:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:03,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:03,020 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash -554710122, now seen corresponding path program 24 times [2020-02-10 19:59:03,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:03,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909967441] [2020-02-10 19:59:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:03,612 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:59:03,744 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:59:03,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 19:59:03,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909967441] [2020-02-10 19:59:03,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651066566] [2020-02-10 19:59:03,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:03,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:03,756 INFO L87 Difference]: Start difference. First operand 3143 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:59:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:03,956 INFO L93 Difference]: Finished difference Result 6108 states and 27077 transitions. [2020-02-10 19:59:03,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:03,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:03,973 INFO L225 Difference]: With dead ends: 6108 [2020-02-10 19:59:03,973 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 19:59:03,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 19:59:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3115. [2020-02-10 19:59:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:59:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15577 transitions. [2020-02-10 19:59:04,180 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15577 transitions. Word has length 31 [2020-02-10 19:59:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:04,180 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15577 transitions. [2020-02-10 19:59:04,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15577 transitions. [2020-02-10 19:59:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:04,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:04,186 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:04,186 INFO L82 PathProgramCache]: Analyzing trace with hash -365158536, now seen corresponding path program 25 times [2020-02-10 19:59:04,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:04,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547826437] [2020-02-10 19:59:04,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:04,749 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:04,881 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:04,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 19:59:04,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547826437] [2020-02-10 19:59:04,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:04,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:04,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253286789] [2020-02-10 19:59:04,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:04,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:04,893 INFO L87 Difference]: Start difference. First operand 3115 states and 15577 transitions. Second operand 12 states. [2020-02-10 19:59:05,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:05,152 INFO L93 Difference]: Finished difference Result 6061 states and 27001 transitions. [2020-02-10 19:59:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:05,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:05,166 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:59:05,166 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 19:59:05,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 19:59:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3135. [2020-02-10 19:59:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15644 transitions. [2020-02-10 19:59:05,412 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15644 transitions. Word has length 31 [2020-02-10 19:59:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:05,412 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15644 transitions. [2020-02-10 19:59:05,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15644 transitions. [2020-02-10 19:59:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:05,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:05,418 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:05,418 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:05,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1632615714, now seen corresponding path program 26 times [2020-02-10 19:59:05,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:05,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461700441] [2020-02-10 19:59:05,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:06,115 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:06,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461700441] [2020-02-10 19:59:06,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:06,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:06,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583188910] [2020-02-10 19:59:06,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:06,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:06,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:06,127 INFO L87 Difference]: Start difference. First operand 3135 states and 15644 transitions. Second operand 12 states. [2020-02-10 19:59:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:06,378 INFO L93 Difference]: Finished difference Result 6062 states and 26995 transitions. [2020-02-10 19:59:06,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:06,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:06,393 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:59:06,393 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:59:06,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:59:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3127. [2020-02-10 19:59:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15623 transitions. [2020-02-10 19:59:06,600 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15623 transitions. Word has length 31 [2020-02-10 19:59:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:06,600 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15623 transitions. [2020-02-10 19:59:06,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15623 transitions. [2020-02-10 19:59:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:06,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:06,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:06,606 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:06,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash -789469772, now seen corresponding path program 27 times [2020-02-10 19:59:06,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:06,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643969071] [2020-02-10 19:59:06,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:07,161 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:07,293 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:07,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643969071] [2020-02-10 19:59:07,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:07,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:07,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018838365] [2020-02-10 19:59:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:07,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:07,304 INFO L87 Difference]: Start difference. First operand 3127 states and 15623 transitions. Second operand 12 states. [2020-02-10 19:59:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:07,535 INFO L93 Difference]: Finished difference Result 6056 states and 26983 transitions. [2020-02-10 19:59:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:07,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:07,550 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:59:07,550 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 19:59:07,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 19:59:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 19:59:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15634 transitions. [2020-02-10 19:59:07,752 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15634 transitions. Word has length 31 [2020-02-10 19:59:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:07,752 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15634 transitions. [2020-02-10 19:59:07,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15634 transitions. [2020-02-10 19:59:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:07,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:07,758 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1393068894, now seen corresponding path program 28 times [2020-02-10 19:59:07,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:07,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538858109] [2020-02-10 19:59:07,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:08,325 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:08,458 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:08,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538858109] [2020-02-10 19:59:08,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:08,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:08,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847620521] [2020-02-10 19:59:08,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:08,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:08,469 INFO L87 Difference]: Start difference. First operand 3133 states and 15634 transitions. Second operand 12 states. [2020-02-10 19:59:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:08,710 INFO L93 Difference]: Finished difference Result 6054 states and 26973 transitions. [2020-02-10 19:59:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:08,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:08,725 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:59:08,725 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:59:08,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:08,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:59:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 19:59:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15617 transitions. [2020-02-10 19:59:08,931 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15617 transitions. Word has length 31 [2020-02-10 19:59:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:08,931 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15617 transitions. [2020-02-10 19:59:08,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15617 transitions. [2020-02-10 19:59:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:08,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:08,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:08,937 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1601573492, now seen corresponding path program 29 times [2020-02-10 19:59:08,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:08,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881844266] [2020-02-10 19:59:08,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:09,495 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:09,625 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:09,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881844266] [2020-02-10 19:59:09,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:09,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:09,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214034987] [2020-02-10 19:59:09,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:09,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:09,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:09,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:09,636 INFO L87 Difference]: Start difference. First operand 3127 states and 15617 transitions. Second operand 12 states. [2020-02-10 19:59:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:09,913 INFO L93 Difference]: Finished difference Result 6058 states and 26981 transitions. [2020-02-10 19:59:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:09,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:09,928 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:59:09,928 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:59:09,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:59:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3133. [2020-02-10 19:59:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 19:59:10,135 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 19:59:10,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:10,135 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 19:59:10,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:10,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 19:59:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:10,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:10,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:10,143 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:10,143 INFO L82 PathProgramCache]: Analyzing trace with hash 756602040, now seen corresponding path program 30 times [2020-02-10 19:59:10,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:10,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156163236] [2020-02-10 19:59:10,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:10,837 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:10,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 19:59:10,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156163236] [2020-02-10 19:59:10,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:10,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:10,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542542315] [2020-02-10 19:59:10,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:10,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:10,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:10,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:10,848 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 19:59:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:11,137 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 19:59:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:11,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:11,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:11,151 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:59:11,151 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 19:59:11,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 19:59:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 19:59:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:59:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15600 transitions. [2020-02-10 19:59:11,395 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15600 transitions. Word has length 31 [2020-02-10 19:59:11,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:11,396 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15600 transitions. [2020-02-10 19:59:11,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15600 transitions. [2020-02-10 19:59:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:11,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:11,401 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:11,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash -633904964, now seen corresponding path program 31 times [2020-02-10 19:59:11,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:11,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069126294] [2020-02-10 19:59:11,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:11,963 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:12,094 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:59:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:12,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069126294] [2020-02-10 19:59:12,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:12,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:12,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543763382] [2020-02-10 19:59:12,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:12,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:12,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:12,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:12,106 INFO L87 Difference]: Start difference. First operand 3121 states and 15600 transitions. Second operand 12 states. [2020-02-10 19:59:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:12,343 INFO L93 Difference]: Finished difference Result 6065 states and 27007 transitions. [2020-02-10 19:59:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:12,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:12,359 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 19:59:12,360 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 19:59:12,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 19:59:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3136. [2020-02-10 19:59:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:59:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15642 transitions. [2020-02-10 19:59:12,566 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15642 transitions. Word has length 31 [2020-02-10 19:59:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:12,566 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15642 transitions. [2020-02-10 19:59:12,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15642 transitions. [2020-02-10 19:59:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:12,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:12,571 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1901362142, now seen corresponding path program 32 times [2020-02-10 19:59:12,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:12,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171061118] [2020-02-10 19:59:12,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:13,165 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:13,301 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:59:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:13,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171061118] [2020-02-10 19:59:13,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:13,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:13,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946913499] [2020-02-10 19:59:13,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:13,312 INFO L87 Difference]: Start difference. First operand 3136 states and 15642 transitions. Second operand 12 states. [2020-02-10 19:59:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:13,559 INFO L93 Difference]: Finished difference Result 6066 states and 27001 transitions. [2020-02-10 19:59:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:13,560 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:13,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:13,575 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 19:59:13,575 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:59:13,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:59:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 19:59:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:59:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15620 transitions. [2020-02-10 19:59:13,796 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15620 transitions. Word has length 31 [2020-02-10 19:59:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:13,796 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15620 transitions. [2020-02-10 19:59:13,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15620 transitions. [2020-02-10 19:59:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:13,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:13,801 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:13,801 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1482527436, now seen corresponding path program 33 times [2020-02-10 19:59:13,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:13,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261497513] [2020-02-10 19:59:13,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:14,369 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:14,501 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:59:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:14,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261497513] [2020-02-10 19:59:14,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:14,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:14,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469070048] [2020-02-10 19:59:14,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:14,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:14,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:14,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:14,512 INFO L87 Difference]: Start difference. First operand 3128 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:59:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:14,761 INFO L93 Difference]: Finished difference Result 6062 states and 26993 transitions. [2020-02-10 19:59:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:14,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:14,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:14,776 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:59:14,776 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 19:59:14,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 19:59:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3135. [2020-02-10 19:59:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15633 transitions. [2020-02-10 19:59:14,974 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15633 transitions. Word has length 31 [2020-02-10 19:59:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:14,974 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15633 transitions. [2020-02-10 19:59:14,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15633 transitions. [2020-02-10 19:59:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:14,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:14,980 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -144960222, now seen corresponding path program 34 times [2020-02-10 19:59:14,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:14,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641217433] [2020-02-10 19:59:14,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:15,499 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:15,635 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:59:15,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 19:59:15,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641217433] [2020-02-10 19:59:15,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:15,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:15,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192881046] [2020-02-10 19:59:15,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:15,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:15,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:15,646 INFO L87 Difference]: Start difference. First operand 3135 states and 15633 transitions. Second operand 12 states. [2020-02-10 19:59:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:16,013 INFO L93 Difference]: Finished difference Result 6061 states and 26984 transitions. [2020-02-10 19:59:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:16,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:16,028 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 19:59:16,029 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:59:16,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:16,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:59:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3128. [2020-02-10 19:59:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 19:59:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 19:59:16,231 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 19:59:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:16,231 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 19:59:16,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 19:59:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:16,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:16,237 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 908515828, now seen corresponding path program 35 times [2020-02-10 19:59:16,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:16,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829012296] [2020-02-10 19:59:16,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:16,804 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:16,941 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:16,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829012296] [2020-02-10 19:59:16,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:16,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:16,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899521134] [2020-02-10 19:59:16,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:16,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:16,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:16,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:16,952 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 19:59:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:17,196 INFO L93 Difference]: Finished difference Result 6064 states and 26990 transitions. [2020-02-10 19:59:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:17,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:17,211 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 19:59:17,212 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 19:59:17,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 19:59:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3135. [2020-02-10 19:59:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 19:59:17,419 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 19:59:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:17,419 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 19:59:17,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 19:59:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:17,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:17,425 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:17,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:17,425 INFO L82 PathProgramCache]: Analyzing trace with hash -781427076, now seen corresponding path program 36 times [2020-02-10 19:59:17,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:17,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503843268] [2020-02-10 19:59:17,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:18,044 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:18,176 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:18,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 19:59:18,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503843268] [2020-02-10 19:59:18,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:18,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:18,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793108889] [2020-02-10 19:59:18,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:18,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:18,187 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:59:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:18,432 INFO L93 Difference]: Finished difference Result 6062 states and 26979 transitions. [2020-02-10 19:59:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:18,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:18,446 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 19:59:18,446 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:59:18,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:59:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3121. [2020-02-10 19:59:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:59:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15594 transitions. [2020-02-10 19:59:18,647 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15594 transitions. Word has length 31 [2020-02-10 19:59:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:18,648 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15594 transitions. [2020-02-10 19:59:18,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15594 transitions. [2020-02-10 19:59:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:18,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:18,653 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962628, now seen corresponding path program 37 times [2020-02-10 19:59:18,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:18,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148819124] [2020-02-10 19:59:18,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:19,217 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:19,348 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:19,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148819124] [2020-02-10 19:59:19,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:19,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:19,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073533522] [2020-02-10 19:59:19,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:19,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:19,359 INFO L87 Difference]: Start difference. First operand 3121 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:59:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:19,609 INFO L93 Difference]: Finished difference Result 6053 states and 26970 transitions. [2020-02-10 19:59:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:19,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:19,624 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:59:19,624 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:59:19,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:59:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 19:59:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 19:59:19,826 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 19:59:19,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:19,826 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 19:59:19,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 19:59:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:19,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:19,831 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 855576038, now seen corresponding path program 38 times [2020-02-10 19:59:19,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:19,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992585501] [2020-02-10 19:59:19,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:20,419 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:20,548 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:20,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992585501] [2020-02-10 19:59:20,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:20,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:20,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293488774] [2020-02-10 19:59:20,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:20,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:20,559 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 19:59:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:20,823 INFO L93 Difference]: Finished difference Result 6051 states and 26960 transitions. [2020-02-10 19:59:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:20,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:20,838 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:59:20,838 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 19:59:20,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 19:59:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 19:59:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15611 transitions. [2020-02-10 19:59:21,044 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15611 transitions. Word has length 31 [2020-02-10 19:59:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:21,044 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15611 transitions. [2020-02-10 19:59:21,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:21,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15611 transitions. [2020-02-10 19:59:21,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:21,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:21,050 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1751273864, now seen corresponding path program 39 times [2020-02-10 19:59:21,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:21,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486414964] [2020-02-10 19:59:21,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:21,620 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:21,750 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 19:59:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:21,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486414964] [2020-02-10 19:59:21,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:21,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:21,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092912555] [2020-02-10 19:59:21,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:21,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:21,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:21,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:21,761 INFO L87 Difference]: Start difference. First operand 3127 states and 15611 transitions. Second operand 12 states. [2020-02-10 19:59:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:22,046 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 19:59:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:22,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:22,062 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 19:59:22,062 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:59:22,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:59:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 19:59:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:59:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15624 transitions. [2020-02-10 19:59:22,263 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15624 transitions. Word has length 31 [2020-02-10 19:59:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:22,264 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15624 transitions. [2020-02-10 19:59:22,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15624 transitions. [2020-02-10 19:59:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:22,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:22,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:22,269 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash -413706650, now seen corresponding path program 40 times [2020-02-10 19:59:22,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:22,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976040332] [2020-02-10 19:59:22,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:22,837 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:22,971 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:59:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:22,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976040332] [2020-02-10 19:59:22,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:22,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:22,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229797575] [2020-02-10 19:59:22,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:22,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:22,982 INFO L87 Difference]: Start difference. First operand 3134 states and 15624 transitions. Second operand 12 states. [2020-02-10 19:59:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:23,257 INFO L93 Difference]: Finished difference Result 6054 states and 26960 transitions. [2020-02-10 19:59:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:23,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:23,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:23,272 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 19:59:23,272 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 19:59:23,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 19:59:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 19:59:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 19:59:23,473 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 19:59:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:23,474 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 19:59:23,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 19:59:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:23,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:23,479 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:23,479 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:23,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:23,480 INFO L82 PathProgramCache]: Analyzing trace with hash -629513288, now seen corresponding path program 41 times [2020-02-10 19:59:23,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:23,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169670187] [2020-02-10 19:59:23,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:23,873 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:59:24,095 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:24,227 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:59:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:24,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169670187] [2020-02-10 19:59:24,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:24,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:24,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583617770] [2020-02-10 19:59:24,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:24,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:24,238 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:59:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:24,475 INFO L93 Difference]: Finished difference Result 6050 states and 26952 transitions. [2020-02-10 19:59:24,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:24,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:24,491 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 19:59:24,491 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 19:59:24,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 19:59:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3133. [2020-02-10 19:59:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15616 transitions. [2020-02-10 19:59:24,697 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15616 transitions. Word has length 31 [2020-02-10 19:59:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:24,698 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15616 transitions. [2020-02-10 19:59:24,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15616 transitions. [2020-02-10 19:59:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:24,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:24,703 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:24,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1474484740, now seen corresponding path program 42 times [2020-02-10 19:59:24,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:24,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198524665] [2020-02-10 19:59:24,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:25,249 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:25,378 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 19:59:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:25,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198524665] [2020-02-10 19:59:25,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:25,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:25,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068841754] [2020-02-10 19:59:25,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:25,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:25,389 INFO L87 Difference]: Start difference. First operand 3133 states and 15616 transitions. Second operand 12 states. [2020-02-10 19:59:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:25,657 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 19:59:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:25,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:25,672 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:59:25,673 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 19:59:25,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 19:59:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3121. [2020-02-10 19:59:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 19:59:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15588 transitions. [2020-02-10 19:59:25,874 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15588 transitions. Word has length 31 [2020-02-10 19:59:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:25,874 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15588 transitions. [2020-02-10 19:59:25,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15588 transitions. [2020-02-10 19:59:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:25,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:25,880 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:25,880 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1486522654, now seen corresponding path program 43 times [2020-02-10 19:59:25,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:25,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080912938] [2020-02-10 19:59:25,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:26,536 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:26,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080912938] [2020-02-10 19:59:26,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:26,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:26,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240186828] [2020-02-10 19:59:26,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:26,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:26,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:26,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:26,547 INFO L87 Difference]: Start difference. First operand 3121 states and 15588 transitions. Second operand 12 states. [2020-02-10 19:59:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:26,842 INFO L93 Difference]: Finished difference Result 6056 states and 26970 transitions. [2020-02-10 19:59:26,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:26,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:26,857 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:59:26,857 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 19:59:26,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 19:59:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 19:59:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15622 transitions. [2020-02-10 19:59:27,068 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15622 transitions. Word has length 31 [2020-02-10 19:59:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:27,068 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15622 transitions. [2020-02-10 19:59:27,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15622 transitions. [2020-02-10 19:59:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:27,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:27,074 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:27,074 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1963473190, now seen corresponding path program 44 times [2020-02-10 19:59:27,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:27,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630747145] [2020-02-10 19:59:27,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:27,767 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:27,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 19:59:27,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630747145] [2020-02-10 19:59:27,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:27,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:27,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614101873] [2020-02-10 19:59:27,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:27,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:27,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:27,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:27,778 INFO L87 Difference]: Start difference. First operand 3133 states and 15622 transitions. Second operand 12 states. [2020-02-10 19:59:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:28,073 INFO L93 Difference]: Finished difference Result 6053 states and 26958 transitions. [2020-02-10 19:59:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:28,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:28,089 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 19:59:28,089 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 19:59:28,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 19:59:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3127. [2020-02-10 19:59:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 19:59:28,290 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 19:59:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:28,290 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 19:59:28,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 19:59:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:28,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:28,296 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1910833890, now seen corresponding path program 45 times [2020-02-10 19:59:28,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:28,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638603369] [2020-02-10 19:59:28,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:28,864 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:28,997 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:29,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 19:59:29,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638603369] [2020-02-10 19:59:29,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:29,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:29,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771713774] [2020-02-10 19:59:29,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:29,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:29,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:29,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:29,008 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 19:59:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:29,331 INFO L93 Difference]: Finished difference Result 6058 states and 26969 transitions. [2020-02-10 19:59:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:29,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:29,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:29,348 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 19:59:29,348 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 19:59:29,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 19:59:29,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3134. [2020-02-10 19:59:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 19:59:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 19:59:29,557 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 19:59:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:29,557 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 19:59:29,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 19:59:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:29,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:29,563 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:29,563 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash 694190502, now seen corresponding path program 46 times [2020-02-10 19:59:29,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:29,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269718591] [2020-02-10 19:59:29,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:30,120 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:30,253 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269718591] [2020-02-10 19:59:30,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:30,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:30,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227981338] [2020-02-10 19:59:30,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:30,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:30,264 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 19:59:30,518 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-02-10 19:59:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:30,542 INFO L93 Difference]: Finished difference Result 6056 states and 26958 transitions. [2020-02-10 19:59:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:30,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:30,559 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 19:59:30,559 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 19:59:30,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 19:59:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 19:59:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 19:59:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15599 transitions. [2020-02-10 19:59:30,765 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15599 transitions. Word has length 31 [2020-02-10 19:59:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:30,765 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15599 transitions. [2020-02-10 19:59:30,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15599 transitions. [2020-02-10 19:59:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:30,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:30,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:30,771 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1114850718, now seen corresponding path program 47 times [2020-02-10 19:59:30,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:30,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566308587] [2020-02-10 19:59:30,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:31,323 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 19:59:31,455 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:31,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566308587] [2020-02-10 19:59:31,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:31,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:31,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446047623] [2020-02-10 19:59:31,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:31,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:31,466 INFO L87 Difference]: Start difference. First operand 3127 states and 15599 transitions. Second operand 12 states. [2020-02-10 19:59:31,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:31,781 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 19:59:31,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:31,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:31,799 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 19:59:31,799 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 19:59:31,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:31,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 19:59:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 19:59:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 19:59:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15610 transitions. [2020-02-10 19:59:32,015 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15610 transitions. Word has length 31 [2020-02-10 19:59:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:32,015 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15610 transitions. [2020-02-10 19:59:32,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15610 transitions. [2020-02-10 19:59:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:32,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:32,020 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:32,020 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:32,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:32,020 INFO L82 PathProgramCache]: Analyzing trace with hash 269879266, now seen corresponding path program 48 times [2020-02-10 19:59:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:32,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300832160] [2020-02-10 19:59:32,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:32,592 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:32,721 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:32,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 19:59:32,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300832160] [2020-02-10 19:59:32,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:32,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:32,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100589255] [2020-02-10 19:59:32,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:32,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:32,731 INFO L87 Difference]: Start difference. First operand 3133 states and 15610 transitions. Second operand 12 states. [2020-02-10 19:59:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:32,990 INFO L93 Difference]: Finished difference Result 6052 states and 26944 transitions. [2020-02-10 19:59:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:32,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:33,005 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 19:59:33,005 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 19:59:33,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 19:59:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3115. [2020-02-10 19:59:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 19:59:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15571 transitions. [2020-02-10 19:59:33,211 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15571 transitions. Word has length 31 [2020-02-10 19:59:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:33,212 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15571 transitions. [2020-02-10 19:59:33,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15571 transitions. [2020-02-10 19:59:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:33,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:33,217 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:33,217 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2124449198, now seen corresponding path program 49 times [2020-02-10 19:59:33,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:33,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260686516] [2020-02-10 19:59:33,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:33,770 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:33,899 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:33,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260686516] [2020-02-10 19:59:33,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:33,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:33,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643205795] [2020-02-10 19:59:33,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:33,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:33,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:33,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:33,909 INFO L87 Difference]: Start difference. First operand 3115 states and 15571 transitions. Second operand 12 states. [2020-02-10 19:59:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:34,218 INFO L93 Difference]: Finished difference Result 6082 states and 27045 transitions. [2020-02-10 19:59:34,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:34,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:34,233 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:59:34,233 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:59:34,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:59:34,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3138. [2020-02-10 19:59:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:59:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 19:59:34,441 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 19:59:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:34,441 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 19:59:34,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 19:59:34,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:34,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:34,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:34,446 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash 903060920, now seen corresponding path program 50 times [2020-02-10 19:59:34,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:34,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054615473] [2020-02-10 19:59:34,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:35,000 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:35,133 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:35,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 19:59:35,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054615473] [2020-02-10 19:59:35,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:35,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:35,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840173899] [2020-02-10 19:59:35,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:35,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:35,144 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 19:59:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:35,450 INFO L93 Difference]: Finished difference Result 6083 states and 27039 transitions. [2020-02-10 19:59:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:35,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:35,465 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 19:59:35,465 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 19:59:35,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 19:59:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3130. [2020-02-10 19:59:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:59:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15626 transitions. [2020-02-10 19:59:35,672 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15626 transitions. Word has length 31 [2020-02-10 19:59:35,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:35,672 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15626 transitions. [2020-02-10 19:59:35,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15626 transitions. [2020-02-10 19:59:35,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:35,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:35,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:35,678 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:35,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:35,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1746206862, now seen corresponding path program 51 times [2020-02-10 19:59:35,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:35,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876528826] [2020-02-10 19:59:35,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:36,233 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:36,362 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:36,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 19:59:36,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876528826] [2020-02-10 19:59:36,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:36,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:36,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834265874] [2020-02-10 19:59:36,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:36,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:36,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:36,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:36,373 INFO L87 Difference]: Start difference. First operand 3130 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:59:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:36,621 INFO L93 Difference]: Finished difference Result 6077 states and 27027 transitions. [2020-02-10 19:59:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:36,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:36,637 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 19:59:36,637 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 19:59:36,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 19:59:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3136. [2020-02-10 19:59:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:59:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15637 transitions. [2020-02-10 19:59:36,844 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15637 transitions. Word has length 31 [2020-02-10 19:59:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:36,845 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15637 transitions. [2020-02-10 19:59:36,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15637 transitions. [2020-02-10 19:59:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:36,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:36,850 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:36,850 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:36,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash -366221768, now seen corresponding path program 52 times [2020-02-10 19:59:36,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:36,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875116383] [2020-02-10 19:59:36,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:37,452 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:37,585 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:37,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875116383] [2020-02-10 19:59:37,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:37,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156134248] [2020-02-10 19:59:37,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:37,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:37,596 INFO L87 Difference]: Start difference. First operand 3136 states and 15637 transitions. Second operand 12 states. [2020-02-10 19:59:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:37,906 INFO L93 Difference]: Finished difference Result 6075 states and 27017 transitions. [2020-02-10 19:59:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:37,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:37,921 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 19:59:37,922 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 19:59:37,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:38,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 19:59:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 19:59:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 19:59:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15620 transitions. [2020-02-10 19:59:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15620 transitions. Word has length 31 [2020-02-10 19:59:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:38,127 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15620 transitions. [2020-02-10 19:59:38,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15620 transitions. [2020-02-10 19:59:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:38,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:38,133 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -157717170, now seen corresponding path program 53 times [2020-02-10 19:59:38,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:38,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034929029] [2020-02-10 19:59:38,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:38,689 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:38,820 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:38,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034929029] [2020-02-10 19:59:38,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:38,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:38,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570810667] [2020-02-10 19:59:38,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:38,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:38,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:38,832 INFO L87 Difference]: Start difference. First operand 3130 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:59:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:39,118 INFO L93 Difference]: Finished difference Result 6079 states and 27025 transitions. [2020-02-10 19:59:39,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:39,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:39,132 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 19:59:39,133 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 19:59:39,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 19:59:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3136. [2020-02-10 19:59:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 19:59:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15631 transitions. [2020-02-10 19:59:39,334 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15631 transitions. Word has length 31 [2020-02-10 19:59:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:39,334 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15631 transitions. [2020-02-10 19:59:39,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15631 transitions. [2020-02-10 19:59:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:39,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:39,339 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:39,339 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:39,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1002688622, now seen corresponding path program 54 times [2020-02-10 19:59:39,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:39,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45220955] [2020-02-10 19:59:39,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:39,907 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:40,040 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:40,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45220955] [2020-02-10 19:59:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:40,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385085554] [2020-02-10 19:59:40,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:40,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:40,051 INFO L87 Difference]: Start difference. First operand 3136 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:59:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:40,356 INFO L93 Difference]: Finished difference Result 6076 states and 27013 transitions. [2020-02-10 19:59:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:40,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:40,371 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 19:59:40,371 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 19:59:40,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 19:59:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3124. [2020-02-10 19:59:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:59:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15603 transitions. [2020-02-10 19:59:40,578 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15603 transitions. Word has length 31 [2020-02-10 19:59:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:40,578 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15603 transitions. [2020-02-10 19:59:40,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15603 transitions. [2020-02-10 19:59:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:40,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:40,584 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -648831620, now seen corresponding path program 55 times [2020-02-10 19:59:40,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:40,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115895062] [2020-02-10 19:59:40,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:41,163 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 19:59:41,293 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 19:59:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:41,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115895062] [2020-02-10 19:59:41,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:41,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:41,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955472668] [2020-02-10 19:59:41,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:41,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:41,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:41,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:41,304 INFO L87 Difference]: Start difference. First operand 3124 states and 15603 transitions. Second operand 12 states. [2020-02-10 19:59:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:41,671 INFO L93 Difference]: Finished difference Result 6100 states and 27082 transitions. [2020-02-10 19:59:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:41,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:41,687 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:59:41,687 INFO L226 Difference]: Without dead ends: 6081 [2020-02-10 19:59:41,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2020-02-10 19:59:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3143. [2020-02-10 19:59:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:59:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15655 transitions. [2020-02-10 19:59:41,894 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15655 transitions. Word has length 31 [2020-02-10 19:59:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:41,895 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15655 transitions. [2020-02-10 19:59:41,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15655 transitions. [2020-02-10 19:59:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:41,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:41,901 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1916288798, now seen corresponding path program 56 times [2020-02-10 19:59:41,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:41,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032850773] [2020-02-10 19:59:41,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:42,593 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:42,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032850773] [2020-02-10 19:59:42,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:42,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:42,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959242159] [2020-02-10 19:59:42,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:42,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:42,604 INFO L87 Difference]: Start difference. First operand 3143 states and 15655 transitions. Second operand 12 states. [2020-02-10 19:59:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:42,975 INFO L93 Difference]: Finished difference Result 6101 states and 27076 transitions. [2020-02-10 19:59:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:42,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:42,991 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 19:59:42,991 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 19:59:42,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 19:59:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3135. [2020-02-10 19:59:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15632 transitions. [2020-02-10 19:59:43,197 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15632 transitions. Word has length 31 [2020-02-10 19:59:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:43,198 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15632 transitions. [2020-02-10 19:59:43,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15632 transitions. [2020-02-10 19:59:43,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:43,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:43,203 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:43,203 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2133920946, now seen corresponding path program 57 times [2020-02-10 19:59:43,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:43,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163067552] [2020-02-10 19:59:43,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:43,777 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:43,910 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:43,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163067552] [2020-02-10 19:59:43,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:43,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:43,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075218643] [2020-02-10 19:59:43,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:43,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:43,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:43,921 INFO L87 Difference]: Start difference. First operand 3135 states and 15632 transitions. Second operand 12 states. [2020-02-10 19:59:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:44,311 INFO L93 Difference]: Finished difference Result 6103 states and 27079 transitions. [2020-02-10 19:59:44,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:44,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:44,326 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 19:59:44,326 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 19:59:44,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 19:59:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3144. [2020-02-10 19:59:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 19:59:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15649 transitions. [2020-02-10 19:59:44,530 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15649 transitions. Word has length 31 [2020-02-10 19:59:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:44,530 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15649 transitions. [2020-02-10 19:59:44,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15649 transitions. [2020-02-10 19:59:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:44,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:44,536 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:44,536 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2063810910, now seen corresponding path program 58 times [2020-02-10 19:59:44,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:44,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353991962] [2020-02-10 19:59:44,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:45,116 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:59:45,250 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:45,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353991962] [2020-02-10 19:59:45,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:45,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:45,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932443065] [2020-02-10 19:59:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:45,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:45,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:45,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:45,261 INFO L87 Difference]: Start difference. First operand 3144 states and 15649 transitions. Second operand 12 states. [2020-02-10 19:59:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:45,593 INFO L93 Difference]: Finished difference Result 6106 states and 27076 transitions. [2020-02-10 19:59:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:45,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:45,609 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 19:59:45,609 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 19:59:45,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 19:59:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3135. [2020-02-10 19:59:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 19:59:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15623 transitions. [2020-02-10 19:59:45,815 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15623 transitions. Word has length 31 [2020-02-10 19:59:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:45,815 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15623 transitions. [2020-02-10 19:59:45,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15623 transitions. [2020-02-10 19:59:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:45,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:45,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:45,821 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash 257122318, now seen corresponding path program 59 times [2020-02-10 19:59:45,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:45,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612950769] [2020-02-10 19:59:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:46,388 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:46,520 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:46,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 19:59:46,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612950769] [2020-02-10 19:59:46,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:46,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:46,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924555685] [2020-02-10 19:59:46,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:46,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:46,531 INFO L87 Difference]: Start difference. First operand 3135 states and 15623 transitions. Second operand 12 states. [2020-02-10 19:59:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:46,769 INFO L93 Difference]: Finished difference Result 6107 states and 27078 transitions. [2020-02-10 19:59:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:46,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:46,785 INFO L225 Difference]: With dead ends: 6107 [2020-02-10 19:59:46,785 INFO L226 Difference]: Without dead ends: 6087 [2020-02-10 19:59:46,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2020-02-10 19:59:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3146. [2020-02-10 19:59:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 19:59:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15643 transitions. [2020-02-10 19:59:46,993 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15643 transitions. Word has length 31 [2020-02-10 19:59:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:46,994 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15643 transitions. [2020-02-10 19:59:46,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15643 transitions. [2020-02-10 19:59:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:46,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:46,999 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:46,999 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:46,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:46,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1594689532, now seen corresponding path program 60 times [2020-02-10 19:59:47,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:47,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505914275] [2020-02-10 19:59:47,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:47,578 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:59:47,705 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:59:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:47,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505914275] [2020-02-10 19:59:47,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:47,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:47,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690943523] [2020-02-10 19:59:47,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:47,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:47,716 INFO L87 Difference]: Start difference. First operand 3146 states and 15643 transitions. Second operand 12 states. [2020-02-10 19:59:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:47,932 INFO L93 Difference]: Finished difference Result 6109 states and 27072 transitions. [2020-02-10 19:59:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:47,932 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:47,948 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 19:59:47,948 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 19:59:47,948 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 19:59:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3124. [2020-02-10 19:59:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:59:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 19:59:48,155 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 19:59:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:48,155 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 19:59:48,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 19:59:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:48,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:48,160 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:48,160 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:48,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:48,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1341889284, now seen corresponding path program 61 times [2020-02-10 19:59:48,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:48,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628977448] [2020-02-10 19:59:48,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:48,718 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:48,850 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:48,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 19:59:48,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628977448] [2020-02-10 19:59:48,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:48,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:48,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276212391] [2020-02-10 19:59:48,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:48,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:48,861 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 19:59:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:49,098 INFO L93 Difference]: Finished difference Result 6082 states and 27028 transitions. [2020-02-10 19:59:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:49,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:49,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:49,114 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 19:59:49,114 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 19:59:49,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 19:59:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3137. [2020-02-10 19:59:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 19:59:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15631 transitions. [2020-02-10 19:59:49,322 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15631 transitions. Word has length 31 [2020-02-10 19:59:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:49,322 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15631 transitions. [2020-02-10 19:59:49,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15631 transitions. [2020-02-10 19:59:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:49,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:49,328 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash 840649382, now seen corresponding path program 62 times [2020-02-10 19:59:49,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:49,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74056387] [2020-02-10 19:59:49,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:49,875 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:50,006 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59: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 19:59:50,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74056387] [2020-02-10 19:59:50,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:50,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:50,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894143488] [2020-02-10 19:59:50,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:50,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:50,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:50,016 INFO L87 Difference]: Start difference. First operand 3137 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:59:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:50,243 INFO L93 Difference]: Finished difference Result 6080 states and 27018 transitions. [2020-02-10 19:59:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:50,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:50,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:50,259 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 19:59:50,259 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 19:59:50,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 19:59:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3131. [2020-02-10 19:59:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:59:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 19:59:50,467 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 19:59:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:50,467 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 19:59:50,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 19:59:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:50,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:50,472 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1892299922, now seen corresponding path program 63 times [2020-02-10 19:59:50,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:50,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101832097] [2020-02-10 19:59:50,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:51,092 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:51,224 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:51,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101832097] [2020-02-10 19:59:51,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:51,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:51,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886284007] [2020-02-10 19:59:51,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:51,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:51,235 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 19:59:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:51,457 INFO L93 Difference]: Finished difference Result 6090 states and 27039 transitions. [2020-02-10 19:59:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:51,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:51,472 INFO L225 Difference]: With dead ends: 6090 [2020-02-10 19:59:51,473 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 19:59:51,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 19:59:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 19:59:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 19:59:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15631 transitions. [2020-02-10 19:59:51,673 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15631 transitions. Word has length 31 [2020-02-10 19:59:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:51,673 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15631 transitions. [2020-02-10 19:59:51,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15631 transitions. [2020-02-10 19:59:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:51,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:51,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:51,678 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1962409958, now seen corresponding path program 64 times [2020-02-10 19:59:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:51,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966862604] [2020-02-10 19:59:51,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:52,236 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:59:52,367 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:52,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966862604] [2020-02-10 19:59:52,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:52,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665786611] [2020-02-10 19:59:52,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:52,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:52,378 INFO L87 Difference]: Start difference. First operand 3140 states and 15631 transitions. Second operand 12 states. [2020-02-10 19:59:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:52,582 INFO L93 Difference]: Finished difference Result 6093 states and 27036 transitions. [2020-02-10 19:59:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:52,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:52,597 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 19:59:52,598 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:59:52,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:59:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3131. [2020-02-10 19:59:52,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 19:59:52,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 19:59:52,803 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 19:59:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:52,804 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 19:59:52,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 19:59:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:52,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:52,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:52,809 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1280906798, now seen corresponding path program 65 times [2020-02-10 19:59:52,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:52,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952507336] [2020-02-10 19:59:52,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:53,359 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:53,489 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:53,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 19:59:53,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952507336] [2020-02-10 19:59:53,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:53,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:53,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078464065] [2020-02-10 19:59:53,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:53,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:53,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:53,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:53,499 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 19:59:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:53,730 INFO L93 Difference]: Finished difference Result 6084 states and 27018 transitions. [2020-02-10 19:59:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:53,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:53,744 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 19:59:53,745 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:59:53,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:59:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3138. [2020-02-10 19:59:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:59:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15620 transitions. [2020-02-10 19:59:53,951 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15620 transitions. Word has length 31 [2020-02-10 19:59:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:53,951 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15620 transitions. [2020-02-10 19:59:53,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15620 transitions. [2020-02-10 19:59:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:53,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:53,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:53,957 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash 901631868, now seen corresponding path program 66 times [2020-02-10 19:59:53,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:53,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914574880] [2020-02-10 19:59:53,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:54,522 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 19:59:54,661 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 19:59:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:54,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914574880] [2020-02-10 19:59:54,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:54,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:54,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621657859] [2020-02-10 19:59:54,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:54,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:54,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:54,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:54,672 INFO L87 Difference]: Start difference. First operand 3138 states and 15620 transitions. Second operand 12 states. [2020-02-10 19:59:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:54,945 INFO L93 Difference]: Finished difference Result 6089 states and 27021 transitions. [2020-02-10 19:59:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:54,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:54,961 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 19:59:54,961 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 19:59:54,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 19:59:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3124. [2020-02-10 19:59:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 19:59:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15587 transitions. [2020-02-10 19:59:55,170 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15587 transitions. Word has length 31 [2020-02-10 19:59:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:55,170 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15587 transitions. [2020-02-10 19:59:55,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15587 transitions. [2020-02-10 19:59:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:55,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:55,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:55,175 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:55,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1501449310, now seen corresponding path program 67 times [2020-02-10 19:59:55,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:55,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613693046] [2020-02-10 19:59:55,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:55,739 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:55,869 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:55,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613693046] [2020-02-10 19:59:55,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:55,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:55,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256837159] [2020-02-10 19:59:55,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:55,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:55,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:55,880 INFO L87 Difference]: Start difference. First operand 3124 states and 15587 transitions. Second operand 12 states. [2020-02-10 19:59:56,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:56,151 INFO L93 Difference]: Finished difference Result 6088 states and 27033 transitions. [2020-02-10 19:59:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:56,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:56,167 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 19:59:56,167 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 19:59:56,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 19:59:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3138. [2020-02-10 19:59:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 19:59:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 19:59:56,375 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 19:59:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:56,375 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 19:59:56,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 19:59:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:56,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:56,381 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1948546534, now seen corresponding path program 68 times [2020-02-10 19:59:56,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:56,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652635685] [2020-02-10 19:59:56,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:56,940 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 19:59:57,072 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:57,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 19:59:57,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652635685] [2020-02-10 19:59:57,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:57,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:57,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653334858] [2020-02-10 19:59:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:57,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:57,083 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 19:59:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:57,310 INFO L93 Difference]: Finished difference Result 6085 states and 27021 transitions. [2020-02-10 19:59:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:57,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:57,325 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 19:59:57,326 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 19:59:57,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 19:59:57,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3132. [2020-02-10 19:59:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:59:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15609 transitions. [2020-02-10 19:59:57,572 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15609 transitions. Word has length 31 [2020-02-10 19:59:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:57,572 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15609 transitions. [2020-02-10 19:59:57,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15609 transitions. [2020-02-10 19:59:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:57,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:57,577 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1732739896, now seen corresponding path program 69 times [2020-02-10 19:59:57,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:57,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775029512] [2020-02-10 19:59:57,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:58,140 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 19:59:58,272 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 19:59:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:59:58,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775029512] [2020-02-10 19:59:58,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:58,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:58,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031211692] [2020-02-10 19:59:58,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:58,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:58,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:58,283 INFO L87 Difference]: Start difference. First operand 3132 states and 15609 transitions. Second operand 12 states. [2020-02-10 19:59:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:58,529 INFO L93 Difference]: Finished difference Result 6098 states and 27048 transitions. [2020-02-10 19:59:58,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:58,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:58,544 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 19:59:58,544 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 19:59:58,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:58,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 19:59:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3143. [2020-02-10 19:59:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 19:59:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15629 transitions. [2020-02-10 19:59:58,746 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15629 transitions. Word has length 31 [2020-02-10 19:59:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:58,746 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15629 transitions. [2020-02-10 19:59:58,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15629 transitions. [2020-02-10 19:59:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:58,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:58,751 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:58,752 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:58,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1224660186, now seen corresponding path program 70 times [2020-02-10 19:59:58,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:58,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214964451] [2020-02-10 19:59:58,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:59:59,325 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 19:59:59,458 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 19:59:59,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 19:59:59,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214964451] [2020-02-10 19:59:59,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:59:59,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 19:59:59,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931470180] [2020-02-10 19:59:59,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 19:59:59,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:59:59,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 19:59:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:59:59,469 INFO L87 Difference]: Start difference. First operand 3143 states and 15629 transitions. Second operand 12 states. [2020-02-10 19:59:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:59:59,715 INFO L93 Difference]: Finished difference Result 6100 states and 27042 transitions. [2020-02-10 19:59:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 19:59:59,715 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 19:59:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:59:59,730 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 19:59:59,730 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 19:59:59,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 19:59:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 19:59:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3132. [2020-02-10 19:59:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 19:59:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 19:59:59,931 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 19:59:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:59:59,932 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 19:59:59,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 19:59:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 19:59:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 19:59:59,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:59:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:59:59,937 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:59:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:59:59,937 INFO L82 PathProgramCache]: Analyzing trace with hash 463457208, now seen corresponding path program 71 times [2020-02-10 19:59:59,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:59:59,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122003935] [2020-02-10 19:59:59,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:59:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:00,525 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:00:00,656 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:00,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:00:00,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122003935] [2020-02-10 20:00:00,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:00,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:00,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448839385] [2020-02-10 20:00:00,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:00,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:00,667 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:00:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:00,882 INFO L93 Difference]: Finished difference Result 6088 states and 27018 transitions. [2020-02-10 20:00:00,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:00,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:00,897 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 20:00:00,897 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:00:00,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:00:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3139. [2020-02-10 20:00:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:00:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15614 transitions. [2020-02-10 20:00:01,102 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15614 transitions. Word has length 31 [2020-02-10 20:00:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:01,102 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15614 transitions. [2020-02-10 20:00:01,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15614 transitions. [2020-02-10 20:00:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:01,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:01,108 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1648971422, now seen corresponding path program 72 times [2020-02-10 20:00:01,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:01,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226055115] [2020-02-10 20:00:01,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:01,672 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:01,807 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:01,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:00:01,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226055115] [2020-02-10 20:00:01,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:01,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:01,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302308265] [2020-02-10 20:00:01,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:01,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:01,818 INFO L87 Difference]: Start difference. First operand 3139 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:00:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:02,009 INFO L93 Difference]: Finished difference Result 6093 states and 27021 transitions. [2020-02-10 20:00:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:02,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:02,024 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:00:02,025 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 20:00:02,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:02,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 20:00:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3115. [2020-02-10 20:00:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:00:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15562 transitions. [2020-02-10 20:00:02,225 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15562 transitions. Word has length 31 [2020-02-10 20:00:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:02,226 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15562 transitions. [2020-02-10 20:00:02,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15562 transitions. [2020-02-10 20:00:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:02,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:02,231 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1726304654, now seen corresponding path program 73 times [2020-02-10 20:00:02,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:02,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658133397] [2020-02-10 20:00:02,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:02,787 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:02,916 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:02,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658133397] [2020-02-10 20:00:02,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:02,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:02,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454078358] [2020-02-10 20:00:02,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:02,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:02,927 INFO L87 Difference]: Start difference. First operand 3115 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:00:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:03,164 INFO L93 Difference]: Finished difference Result 6062 states and 26989 transitions. [2020-02-10 20:00:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:03,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:03,179 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:00:03,179 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:00:03,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:00:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3134. [2020-02-10 20:00:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:00:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 20:00:03,387 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 20:00:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:03,388 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 20:00:03,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:03,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 20:00:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:03,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:03,393 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:03,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash -386123976, now seen corresponding path program 74 times [2020-02-10 20:00:03,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:03,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867891617] [2020-02-10 20:00:03,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:03,965 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:04,136 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:04,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:00:04,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867891617] [2020-02-10 20:00:04,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:04,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:04,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029822704] [2020-02-10 20:00:04,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:04,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:04,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:04,146 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 20:00:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:04,438 INFO L93 Difference]: Finished difference Result 6060 states and 26979 transitions. [2020-02-10 20:00:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:04,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:04,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:04,453 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:00:04,453 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:00:04,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:00:04,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3128. [2020-02-10 20:00:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:00:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15612 transitions. [2020-02-10 20:00:04,661 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15612 transitions. Word has length 31 [2020-02-10 20:00:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:04,662 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15612 transitions. [2020-02-10 20:00:04,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15612 transitions. [2020-02-10 20:00:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:04,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:04,667 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1301993418, now seen corresponding path program 75 times [2020-02-10 20:00:04,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:04,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911227694] [2020-02-10 20:00:04,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:05,285 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:05,415 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:00:05,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:00:05,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911227694] [2020-02-10 20:00:05,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:05,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:05,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153914667] [2020-02-10 20:00:05,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:05,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:05,425 INFO L87 Difference]: Start difference. First operand 3128 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:00:05,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:05,671 INFO L93 Difference]: Finished difference Result 6064 states and 26988 transitions. [2020-02-10 20:00:05,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:05,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:05,686 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:00:05,687 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:00:05,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:05,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:00:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3135. [2020-02-10 20:00:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:00:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 20:00:05,903 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 20:00:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:05,903 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 20:00:05,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 20:00:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:05,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:05,909 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:05,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1655406664, now seen corresponding path program 76 times [2020-02-10 20:00:05,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:05,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478062737] [2020-02-10 20:00:05,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:06,567 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:06,698 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:06,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:06,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478062737] [2020-02-10 20:00:06,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:06,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:06,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170826665] [2020-02-10 20:00:06,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:06,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:06,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:06,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:06,708 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:00:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:06,957 INFO L93 Difference]: Finished difference Result 6063 states and 26979 transitions. [2020-02-10 20:00:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:06,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:06,972 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:00:06,972 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:00:06,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:00:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 20:00:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:00:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15606 transitions. [2020-02-10 20:00:07,173 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15606 transitions. Word has length 31 [2020-02-10 20:00:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:07,173 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15606 transitions. [2020-02-10 20:00:07,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15606 transitions. [2020-02-10 20:00:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:07,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:07,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:07,179 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:07,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1871213302, now seen corresponding path program 77 times [2020-02-10 20:00:07,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:07,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828354631] [2020-02-10 20:00:07,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:07,746 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:00:07,876 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:07,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828354631] [2020-02-10 20:00:07,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:07,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:07,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39912972] [2020-02-10 20:00:07,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:07,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:07,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:07,887 INFO L87 Difference]: Start difference. First operand 3128 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:00:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:08,168 INFO L93 Difference]: Finished difference Result 6059 states and 26971 transitions. [2020-02-10 20:00:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:08,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:08,183 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 20:00:08,183 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:00:08,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:00:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3134. [2020-02-10 20:00:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:00:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15617 transitions. [2020-02-10 20:00:08,385 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15617 transitions. Word has length 31 [2020-02-10 20:00:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:08,385 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15617 transitions. [2020-02-10 20:00:08,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15617 transitions. [2020-02-10 20:00:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:08,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:08,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:08,391 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1578782542, now seen corresponding path program 78 times [2020-02-10 20:00:08,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272565789] [2020-02-10 20:00:08,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:08,939 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:09,071 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:09,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:00:09,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272565789] [2020-02-10 20:00:09,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:09,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:09,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423444903] [2020-02-10 20:00:09,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:09,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:09,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:09,081 INFO L87 Difference]: Start difference. First operand 3134 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:00:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:09,314 INFO L93 Difference]: Finished difference Result 6060 states and 26967 transitions. [2020-02-10 20:00:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:09,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:09,332 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:00:09,332 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:00:09,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:09,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:00:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3122. [2020-02-10 20:00:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:00:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15589 transitions. [2020-02-10 20:00:09,536 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15589 transitions. Word has length 31 [2020-02-10 20:00:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:09,536 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15589 transitions. [2020-02-10 20:00:09,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15589 transitions. [2020-02-10 20:00:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:09,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:09,541 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -824298636, now seen corresponding path program 79 times [2020-02-10 20:00:09,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:09,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868228100] [2020-02-10 20:00:09,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:10,112 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:10,245 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:10,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868228100] [2020-02-10 20:00:10,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:10,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:10,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644708087] [2020-02-10 20:00:10,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:10,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:10,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:10,256 INFO L87 Difference]: Start difference. First operand 3122 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:00:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:10,506 INFO L93 Difference]: Finished difference Result 6070 states and 27000 transitions. [2020-02-10 20:00:10,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:10,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:10,521 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 20:00:10,521 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:00:10,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:00:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 20:00:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:00:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 20:00:10,722 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 20:00:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:10,722 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 20:00:10,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 20:00:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:10,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:10,727 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1358240030, now seen corresponding path program 80 times [2020-02-10 20:00:10,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:10,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833942442] [2020-02-10 20:00:10,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:11,312 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:11,445 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:11,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833942442] [2020-02-10 20:00:11,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:11,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:11,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57604387] [2020-02-10 20:00:11,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:11,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:11,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:11,454 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:00:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:11,675 INFO L93 Difference]: Finished difference Result 6068 states and 26990 transitions. [2020-02-10 20:00:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:11,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:11,690 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:00:11,690 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:00:11,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:11,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:00:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 20:00:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15609 transitions. [2020-02-10 20:00:11,898 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15609 transitions. Word has length 31 [2020-02-10 20:00:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:11,898 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15609 transitions. [2020-02-10 20:00:11,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15609 transitions. [2020-02-10 20:00:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:11,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:11,903 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1885076726, now seen corresponding path program 81 times [2020-02-10 20:00:11,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:11,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649171606] [2020-02-10 20:00:11,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:12,559 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:12,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649171606] [2020-02-10 20:00:12,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:12,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:12,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738447134] [2020-02-10 20:00:12,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:12,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:12,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:12,570 INFO L87 Difference]: Start difference. First operand 3129 states and 15609 transitions. Second operand 12 states. [2020-02-10 20:00:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:12,801 INFO L93 Difference]: Finished difference Result 6078 states and 27011 transitions. [2020-02-10 20:00:12,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:12,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:12,817 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:00:12,817 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:00:12,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:00:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3138. [2020-02-10 20:00:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:00:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 20:00:13,019 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 20:00:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:13,020 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 20:00:13,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 20:00:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:13,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:13,025 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:13,025 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1814966690, now seen corresponding path program 82 times [2020-02-10 20:00:13,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:13,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377697713] [2020-02-10 20:00:13,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:13,325 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2020-02-10 20:00:13,461 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 20:00:13,846 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:00:13,978 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:13,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:00:13,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377697713] [2020-02-10 20:00:13,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:13,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:13,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262497999] [2020-02-10 20:00:13,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:13,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:13,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:13,989 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:00:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:14,188 INFO L93 Difference]: Finished difference Result 6081 states and 27008 transitions. [2020-02-10 20:00:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:14,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:14,203 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:00:14,203 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:00:14,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:14,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:00:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3129. [2020-02-10 20:00:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 20:00:14,409 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 20:00:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:14,409 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 20:00:14,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:14,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 20:00:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:14,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:14,417 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:14,417 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash -763316150, now seen corresponding path program 83 times [2020-02-10 20:00:14,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:14,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724096077] [2020-02-10 20:00:14,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:14,986 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:15,115 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:15,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:00:15,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724096077] [2020-02-10 20:00:15,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:15,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:15,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199063097] [2020-02-10 20:00:15,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:15,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:15,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:15,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:15,126 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:00:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:15,362 INFO L93 Difference]: Finished difference Result 6072 states and 26990 transitions. [2020-02-10 20:00:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:15,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:15,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:15,377 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:00:15,377 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 20:00:15,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 20:00:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3136. [2020-02-10 20:00:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:00:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15615 transitions. [2020-02-10 20:00:15,584 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15615 transitions. Word has length 31 [2020-02-10 20:00:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:15,584 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15615 transitions. [2020-02-10 20:00:15,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15615 transitions. [2020-02-10 20:00:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:15,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:15,590 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1419222516, now seen corresponding path program 84 times [2020-02-10 20:00:15,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:15,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799713184] [2020-02-10 20:00:15,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:16,167 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:00:16,293 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:00:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:16,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799713184] [2020-02-10 20:00:16,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:16,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:16,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063358023] [2020-02-10 20:00:16,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:16,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:16,303 INFO L87 Difference]: Start difference. First operand 3136 states and 15615 transitions. Second operand 12 states. [2020-02-10 20:00:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:16,521 INFO L93 Difference]: Finished difference Result 6077 states and 26993 transitions. [2020-02-10 20:00:16,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:16,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:16,537 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:00:16,537 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:00:16,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:00:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3122. [2020-02-10 20:00:16,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:00:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 20:00:16,739 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 20:00:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:16,739 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 20:00:16,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 20:00:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:16,744 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:16,744 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1517356300, now seen corresponding path program 85 times [2020-02-10 20:00:16,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:16,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112488153] [2020-02-10 20:00:16,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:17,301 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:17,431 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:00:17,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:00:17,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112488153] [2020-02-10 20:00:17,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:17,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:17,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544990365] [2020-02-10 20:00:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:17,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:17,441 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:00:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:17,737 INFO L93 Difference]: Finished difference Result 6076 states and 27010 transitions. [2020-02-10 20:00:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:17,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:17,752 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:00:17,753 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:00:17,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:00:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3137. [2020-02-10 20:00:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:00:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15625 transitions. [2020-02-10 20:00:18,018 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15625 transitions. Word has length 31 [2020-02-10 20:00:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:18,018 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15625 transitions. [2020-02-10 20:00:18,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15625 transitions. [2020-02-10 20:00:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:18,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:18,024 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash -179789086, now seen corresponding path program 86 times [2020-02-10 20:00:18,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:18,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773701542] [2020-02-10 20:00:18,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:18,604 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:18,736 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:18,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:00:18,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773701542] [2020-02-10 20:00:18,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:18,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:18,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524191976] [2020-02-10 20:00:18,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:18,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:18,747 INFO L87 Difference]: Start difference. First operand 3137 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:00:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:19,038 INFO L93 Difference]: Finished difference Result 6075 states and 27001 transitions. [2020-02-10 20:00:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:19,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:19,053 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:00:19,054 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:00:19,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:00:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3130. [2020-02-10 20:00:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:00:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15605 transitions. [2020-02-10 20:00:19,261 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15605 transitions. Word has length 31 [2020-02-10 20:00:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:19,261 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15605 transitions. [2020-02-10 20:00:19,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15605 transitions. [2020-02-10 20:00:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:19,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:19,266 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2141144142, now seen corresponding path program 87 times [2020-02-10 20:00:19,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:19,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554965746] [2020-02-10 20:00:19,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:19,836 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:19,969 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:00:19,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:00:19,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554965746] [2020-02-10 20:00:19,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:19,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:19,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161176460] [2020-02-10 20:00:19,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:19,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:19,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:19,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:19,980 INFO L87 Difference]: Start difference. First operand 3130 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:00:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:20,241 INFO L93 Difference]: Finished difference Result 6082 states and 27015 transitions. [2020-02-10 20:00:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:20,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:20,256 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:00:20,256 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:00:20,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:00:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3139. [2020-02-10 20:00:20,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:00:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 20:00:20,458 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 20:00:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:20,458 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 20:00:20,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 20:00:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:20,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:20,463 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:20,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2083713118, now seen corresponding path program 88 times [2020-02-10 20:00:20,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:20,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304816509] [2020-02-10 20:00:20,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:21,019 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 20:00:21,154 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:00:21,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:00:21,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304816509] [2020-02-10 20:00:21,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:21,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:21,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704969395] [2020-02-10 20:00:21,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:21,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:21,165 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:00:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:21,401 INFO L93 Difference]: Finished difference Result 6085 states and 27012 transitions. [2020-02-10 20:00:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:21,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:21,417 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 20:00:21,418 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:00:21,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:21,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:00:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3130. [2020-02-10 20:00:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:00:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 20:00:21,625 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 20:00:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:21,625 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 20:00:21,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 20:00:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:21,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:21,631 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1993622030, now seen corresponding path program 89 times [2020-02-10 20:00:21,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:21,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500394159] [2020-02-10 20:00:21,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:22,200 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:22,329 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:22,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500394159] [2020-02-10 20:00:22,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:22,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:22,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013714686] [2020-02-10 20:00:22,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:22,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:22,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:22,340 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:00:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:22,569 INFO L93 Difference]: Finished difference Result 6079 states and 27000 transitions. [2020-02-10 20:00:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:22,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:22,585 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:00:22,585 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:00:22,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:00:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 20:00:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:00:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 20:00:22,791 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 20:00:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:22,791 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 20:00:22,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 20:00:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:22,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:22,797 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:22,797 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash 726164852, now seen corresponding path program 90 times [2020-02-10 20:00:22,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:22,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838698309] [2020-02-10 20:00:22,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:23,353 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:00:23,485 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:23,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:00:23,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838698309] [2020-02-10 20:00:23,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:23,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:23,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305988486] [2020-02-10 20:00:23,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:23,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:23,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:23,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:23,496 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:00:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:23,693 INFO L93 Difference]: Finished difference Result 6083 states and 27000 transitions. [2020-02-10 20:00:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:23,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:23,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:23,708 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:00:23,708 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:00:23,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:23,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:00:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3122. [2020-02-10 20:00:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:00:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 20:00:23,915 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 20:00:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:23,915 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 20:00:23,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 20:00:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:23,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:23,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:23,920 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:23,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1080021854, now seen corresponding path program 91 times [2020-02-10 20:00:23,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:23,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332270118] [2020-02-10 20:00:23,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:24,492 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:00:24,625 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:24,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332270118] [2020-02-10 20:00:24,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:24,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:24,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921697761] [2020-02-10 20:00:24,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:24,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:24,636 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:00:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:24,933 INFO L93 Difference]: Finished difference Result 6065 states and 26975 transitions. [2020-02-10 20:00:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:24,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:24,949 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:00:24,949 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:00:24,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:00:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3135. [2020-02-10 20:00:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:00:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15612 transitions. [2020-02-10 20:00:25,196 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15612 transitions. Word has length 31 [2020-02-10 20:00:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:25,196 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15612 transitions. [2020-02-10 20:00:25,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15612 transitions. [2020-02-10 20:00:25,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:25,201 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:25,202 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:25,202 INFO L82 PathProgramCache]: Analyzing trace with hash 235050402, now seen corresponding path program 92 times [2020-02-10 20:00:25,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:25,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739777764] [2020-02-10 20:00:25,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:25,751 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:25,882 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:25,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:00:25,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739777764] [2020-02-10 20:00:25,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:25,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:25,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127349276] [2020-02-10 20:00:25,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:25,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:25,893 INFO L87 Difference]: Start difference. First operand 3135 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:00:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:26,127 INFO L93 Difference]: Finished difference Result 6066 states and 26971 transitions. [2020-02-10 20:00:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:26,128 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:26,143 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:00:26,143 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:00:26,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:00:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3129. [2020-02-10 20:00:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 20:00:26,345 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 20:00:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:26,345 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 20:00:26,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 20:00:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:26,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:26,351 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 443555000, now seen corresponding path program 93 times [2020-02-10 20:00:26,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:26,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076311161] [2020-02-10 20:00:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:26,906 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:00:27,039 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:27,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076311161] [2020-02-10 20:00:27,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:27,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:27,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786927237] [2020-02-10 20:00:27,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:27,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:27,049 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:00:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:27,311 INFO L93 Difference]: Finished difference Result 6070 states and 26978 transitions. [2020-02-10 20:00:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:27,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:27,326 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 20:00:27,326 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 20:00:27,326 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 20:00:27,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 20:00:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:00:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15608 transitions. [2020-02-10 20:00:27,528 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15608 transitions. Word has length 31 [2020-02-10 20:00:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:27,528 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15608 transitions. [2020-02-10 20:00:27,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15608 transitions. [2020-02-10 20:00:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:27,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:27,533 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1668873630, now seen corresponding path program 94 times [2020-02-10 20:00:27,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:27,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663636679] [2020-02-10 20:00:27,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:28,106 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:00:28,241 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:28,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663636679] [2020-02-10 20:00:28,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:28,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:28,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144251537] [2020-02-10 20:00:28,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:28,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:28,251 INFO L87 Difference]: Start difference. First operand 3136 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:00:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:28,492 INFO L93 Difference]: Finished difference Result 6075 states and 26981 transitions. [2020-02-10 20:00:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:28,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:28,508 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:00:28,508 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:00:28,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:00:28,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 20:00:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:00:28,709 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:00:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:28,709 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:00:28,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:00:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:28,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:28,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:28,715 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -825727688, now seen corresponding path program 95 times [2020-02-10 20:00:28,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:28,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131413327] [2020-02-10 20:00:28,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:29,265 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:00:29,398 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:29,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:29,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131413327] [2020-02-10 20:00:29,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:29,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:29,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023558636] [2020-02-10 20:00:29,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:29,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:29,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:29,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:29,410 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:00:29,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:29,676 INFO L93 Difference]: Finished difference Result 6073 states and 26978 transitions. [2020-02-10 20:00:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:29,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:29,692 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:00:29,692 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 20:00:29,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 20:00:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3137. [2020-02-10 20:00:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:00:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15603 transitions. [2020-02-10 20:00:29,899 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15603 transitions. Word has length 31 [2020-02-10 20:00:29,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:29,899 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15603 transitions. [2020-02-10 20:00:29,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15603 transitions. [2020-02-10 20:00:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:29,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:29,905 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:29,905 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2093184866, now seen corresponding path program 96 times [2020-02-10 20:00:29,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:29,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929286575] [2020-02-10 20:00:29,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:30,462 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:00:30,595 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:30,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:00:30,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929286575] [2020-02-10 20:00:30,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:30,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:30,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654566235] [2020-02-10 20:00:30,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:30,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:30,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:30,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:30,606 INFO L87 Difference]: Start difference. First operand 3137 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:00:30,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:30,933 INFO L93 Difference]: Finished difference Result 6077 states and 26978 transitions. [2020-02-10 20:00:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:30,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:30,948 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:00:30,948 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:00:30,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:31,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:00:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3115. [2020-02-10 20:00:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:00:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 20:00:31,150 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 20:00:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:31,150 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 20:00:31,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 20:00:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:31,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:31,155 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash -192546034, now seen corresponding path program 97 times [2020-02-10 20:00:31,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:31,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55392762] [2020-02-10 20:00:31,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:31,696 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:31,826 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:31,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55392762] [2020-02-10 20:00:31,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:31,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:31,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752004727] [2020-02-10 20:00:31,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:31,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:31,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:31,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:31,837 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:00:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:32,194 INFO L93 Difference]: Finished difference Result 6071 states and 27001 transitions. [2020-02-10 20:00:32,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:32,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:32,209 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:00:32,210 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:00:32,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:00:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 20:00:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:00:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 20:00:32,410 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 20:00:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:32,410 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 20:00:32,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 20:00:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:32,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:32,416 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:32,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:32,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1037517486, now seen corresponding path program 98 times [2020-02-10 20:00:32,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:32,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847063987] [2020-02-10 20:00:32,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:33,086 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:33,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:00:33,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847063987] [2020-02-10 20:00:33,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:33,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:33,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192244775] [2020-02-10 20:00:33,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:33,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:33,097 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:00:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:33,343 INFO L93 Difference]: Finished difference Result 6068 states and 26989 transitions. [2020-02-10 20:00:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:33,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:33,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:33,359 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:00:33,359 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:00:33,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:00:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 20:00:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15608 transitions. [2020-02-10 20:00:33,567 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15608 transitions. Word has length 31 [2020-02-10 20:00:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:33,567 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15608 transitions. [2020-02-10 20:00:33,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15608 transitions. [2020-02-10 20:00:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:33,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:33,572 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:33,572 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:33,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:33,573 INFO L82 PathProgramCache]: Analyzing trace with hash -616857270, now seen corresponding path program 99 times [2020-02-10 20:00:33,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:33,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671897217] [2020-02-10 20:00:33,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:34,119 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:34,253 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:34,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:00:34,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671897217] [2020-02-10 20:00:34,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:34,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:34,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98037820] [2020-02-10 20:00:34,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:34,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:34,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:34,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:34,263 INFO L87 Difference]: Start difference. First operand 3129 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:00:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:34,589 INFO L93 Difference]: Finished difference Result 6073 states and 27000 transitions. [2020-02-10 20:00:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:34,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:34,604 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:00:34,605 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 20:00:34,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 20:00:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 20:00:34,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:00:34,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15621 transitions. [2020-02-10 20:00:34,813 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15621 transitions. Word has length 31 [2020-02-10 20:00:34,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:34,813 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15621 transitions. [2020-02-10 20:00:34,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15621 transitions. [2020-02-10 20:00:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:34,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:34,818 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:34,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:34,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1988167122, now seen corresponding path program 100 times [2020-02-10 20:00:34,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:34,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105554219] [2020-02-10 20:00:34,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:35,481 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:35,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:00:35,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105554219] [2020-02-10 20:00:35,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:35,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:35,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775727852] [2020-02-10 20:00:35,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:35,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:35,494 INFO L87 Difference]: Start difference. First operand 3136 states and 15621 transitions. Second operand 12 states. [2020-02-10 20:00:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:35,868 INFO L93 Difference]: Finished difference Result 6071 states and 26989 transitions. [2020-02-10 20:00:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:35,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:35,884 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:00:35,884 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:00:35,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:00:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 20:00:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:00:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 20:00:36,090 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 20:00:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:36,090 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 20:00:36,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:36,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 20:00:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:36,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:36,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:36,095 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1886139958, now seen corresponding path program 101 times [2020-02-10 20:00:36,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:36,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553751090] [2020-02-10 20:00:36,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:36,639 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:00:36,770 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:36,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:00:36,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553751090] [2020-02-10 20:00:36,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:36,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:36,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727688350] [2020-02-10 20:00:36,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:36,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:36,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:36,780 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:00:37,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:37,010 INFO L93 Difference]: Finished difference Result 6066 states and 26979 transitions. [2020-02-10 20:00:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:37,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:37,028 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:00:37,028 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:00:37,028 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:00:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3135. [2020-02-10 20:00:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:00:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15613 transitions. [2020-02-10 20:00:37,228 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15613 transitions. Word has length 31 [2020-02-10 20:00:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:37,228 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15613 transitions. [2020-02-10 20:00:37,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15613 transitions. [2020-02-10 20:00:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:37,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:37,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:37,233 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:37,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1563855886, now seen corresponding path program 102 times [2020-02-10 20:00:37,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:37,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103287416] [2020-02-10 20:00:37,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:37,773 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:37,904 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:37,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:00:37,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103287416] [2020-02-10 20:00:37,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:37,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:37,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140044641] [2020-02-10 20:00:37,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:37,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:37,914 INFO L87 Difference]: Start difference. First operand 3135 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:00:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:38,149 INFO L93 Difference]: Finished difference Result 6067 states and 26975 transitions. [2020-02-10 20:00:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:38,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:38,164 INFO L225 Difference]: With dead ends: 6067 [2020-02-10 20:00:38,164 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:00:38,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:00:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3123. [2020-02-10 20:00:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:00:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 20:00:38,364 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 20:00:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:38,364 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 20:00:38,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 20:00:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:38,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:38,369 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1551817972, now seen corresponding path program 103 times [2020-02-10 20:00:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:38,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482281558] [2020-02-10 20:00:38,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:38,937 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:39,069 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:39,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482281558] [2020-02-10 20:00:39,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:39,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:39,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038584332] [2020-02-10 20:00:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:39,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:39,080 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:00:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:39,339 INFO L93 Difference]: Finished difference Result 6082 states and 27018 transitions. [2020-02-10 20:00:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:39,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:39,355 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:00:39,355 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:00:39,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:39,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:00:39,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3137. [2020-02-10 20:00:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:00:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15624 transitions. [2020-02-10 20:00:39,556 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15624 transitions. Word has length 31 [2020-02-10 20:00:39,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:39,556 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15624 transitions. [2020-02-10 20:00:39,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15624 transitions. [2020-02-10 20:00:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:39,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:39,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:39,562 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:39,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:39,562 INFO L82 PathProgramCache]: Analyzing trace with hash 706846520, now seen corresponding path program 104 times [2020-02-10 20:00:39,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:39,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441494195] [2020-02-10 20:00:39,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:40,101 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:00:40,229 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:40,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441494195] [2020-02-10 20:00:40,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:40,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:40,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384953712] [2020-02-10 20:00:40,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:40,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:40,239 INFO L87 Difference]: Start difference. First operand 3137 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:00:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:40,455 INFO L93 Difference]: Finished difference Result 6079 states and 27006 transitions. [2020-02-10 20:00:40,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:40,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:40,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:40,470 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:00:40,470 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:00:40,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:00:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3131. [2020-02-10 20:00:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:00:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 20:00:40,679 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 20:00:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:40,679 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 20:00:40,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 20:00:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:40,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:40,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:40,684 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:40,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash 491039882, now seen corresponding path program 105 times [2020-02-10 20:00:40,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:40,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023746885] [2020-02-10 20:00:40,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:41,525 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:41,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023746885] [2020-02-10 20:00:41,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:41,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:41,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204174282] [2020-02-10 20:00:41,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:41,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:41,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:41,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:41,536 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:00:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:41,755 INFO L93 Difference]: Finished difference Result 6092 states and 27033 transitions. [2020-02-10 20:00:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:41,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:41,770 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:00:41,771 INFO L226 Difference]: Without dead ends: 6072 [2020-02-10 20:00:41,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2020-02-10 20:00:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 3142. [2020-02-10 20:00:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:00:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15627 transitions. [2020-02-10 20:00:41,976 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15627 transitions. Word has length 31 [2020-02-10 20:00:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:41,976 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15627 transitions. [2020-02-10 20:00:41,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15627 transitions. [2020-02-10 20:00:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:41,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:41,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:41,982 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:41,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1828607096, now seen corresponding path program 106 times [2020-02-10 20:00:41,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:41,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998593655] [2020-02-10 20:00:41,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:42,556 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:42,687 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:42,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:00:42,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998593655] [2020-02-10 20:00:42,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:42,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:42,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081820812] [2020-02-10 20:00:42,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:42,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:42,697 INFO L87 Difference]: Start difference. First operand 3142 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:00:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:42,887 INFO L93 Difference]: Finished difference Result 6094 states and 27027 transitions. [2020-02-10 20:00:42,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:42,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:42,903 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 20:00:42,903 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:00:42,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:00:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3131. [2020-02-10 20:00:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:00:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15599 transitions. [2020-02-10 20:00:43,105 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15599 transitions. Word has length 31 [2020-02-10 20:00:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:43,105 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15599 transitions. [2020-02-10 20:00:43,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15599 transitions. [2020-02-10 20:00:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:43,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:43,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:43,110 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash -778242806, now seen corresponding path program 107 times [2020-02-10 20:00:43,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:43,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784539130] [2020-02-10 20:00:43,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:43,657 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:00:43,791 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:43,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784539130] [2020-02-10 20:00:43,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:43,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:43,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760379600] [2020-02-10 20:00:43,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:43,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:43,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:43,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:43,801 INFO L87 Difference]: Start difference. First operand 3131 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:00:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:44,023 INFO L93 Difference]: Finished difference Result 6082 states and 27003 transitions. [2020-02-10 20:00:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:44,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:44,039 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:00:44,039 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:00:44,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:00:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3138. [2020-02-10 20:00:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:00:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 20:00:44,240 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 20:00:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:44,240 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 20:00:44,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 20:00:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:44,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:44,245 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:44,245 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:44,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1404295860, now seen corresponding path program 108 times [2020-02-10 20:00:44,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:44,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451671080] [2020-02-10 20:00:44,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:44,804 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:44,933 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:44,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:00:44,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451671080] [2020-02-10 20:00:44,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:44,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:44,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544774977] [2020-02-10 20:00:44,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:44,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:44,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:44,944 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:00:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:45,134 INFO L93 Difference]: Finished difference Result 6087 states and 27006 transitions. [2020-02-10 20:00:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:45,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:45,149 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:00:45,149 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:00:45,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:00:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3123. [2020-02-10 20:00:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:00:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15577 transitions. [2020-02-10 20:00:45,351 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15577 transitions. Word has length 31 [2020-02-10 20:00:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:45,351 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15577 transitions. [2020-02-10 20:00:45,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:45,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15577 transitions. [2020-02-10 20:00:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:45,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:45,357 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 858760308, now seen corresponding path program 109 times [2020-02-10 20:00:45,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:45,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396672826] [2020-02-10 20:00:45,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:45,906 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:46,041 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:46,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396672826] [2020-02-10 20:00:46,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:46,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:46,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411971110] [2020-02-10 20:00:46,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:46,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:46,051 INFO L87 Difference]: Start difference. First operand 3123 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:00:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:46,321 INFO L93 Difference]: Finished difference Result 6088 states and 27027 transitions. [2020-02-10 20:00:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:46,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:46,337 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 20:00:46,337 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 20:00:46,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 20:00:46,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3139. [2020-02-10 20:00:46,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:00:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 20:00:46,543 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 20:00:46,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:46,543 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 20:00:46,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:46,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 20:00:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:46,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:46,548 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:46,549 INFO L82 PathProgramCache]: Analyzing trace with hash -831182596, now seen corresponding path program 110 times [2020-02-10 20:00:46,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:46,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904170249] [2020-02-10 20:00:46,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:47,125 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:47,256 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:47,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904170249] [2020-02-10 20:00:47,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:47,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:47,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486724550] [2020-02-10 20:00:47,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:47,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:47,267 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:00:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:47,552 INFO L93 Difference]: Finished difference Result 6086 states and 27016 transitions. [2020-02-10 20:00:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:47,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:47,567 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:00:47,567 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:00:47,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:00:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3132. [2020-02-10 20:00:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:00:47,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15602 transitions. [2020-02-10 20:00:47,773 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15602 transitions. Word has length 31 [2020-02-10 20:00:47,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:47,774 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15602 transitions. [2020-02-10 20:00:47,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:47,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15602 transitions. [2020-02-10 20:00:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:47,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:47,779 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 222293454, now seen corresponding path program 111 times [2020-02-10 20:00:47,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:47,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12081232] [2020-02-10 20:00:47,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:48,359 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:00:48,488 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:00:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:48,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12081232] [2020-02-10 20:00:48,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:48,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:48,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921142419] [2020-02-10 20:00:48,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:48,498 INFO L87 Difference]: Start difference. First operand 3132 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:00:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:48,726 INFO L93 Difference]: Finished difference Result 6096 states and 27036 transitions. [2020-02-10 20:00:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:48,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:48,742 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:00:48,742 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:00:48,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:00:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3143. [2020-02-10 20:00:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:00:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15622 transitions. [2020-02-10 20:00:48,948 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15622 transitions. Word has length 31 [2020-02-10 20:00:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:48,948 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15622 transitions. [2020-02-10 20:00:48,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15622 transitions. [2020-02-10 20:00:48,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:48,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:48,955 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:48,955 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:48,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:48,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1559860668, now seen corresponding path program 112 times [2020-02-10 20:00:48,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:48,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275937736] [2020-02-10 20:00:48,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:49,520 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:49,651 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:49,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:49,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275937736] [2020-02-10 20:00:49,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:49,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:49,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481867801] [2020-02-10 20:00:49,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:49,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:49,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:49,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:49,662 INFO L87 Difference]: Start difference. First operand 3143 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:00:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:49,854 INFO L93 Difference]: Finished difference Result 6098 states and 27030 transitions. [2020-02-10 20:00:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:49,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:49,870 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 20:00:49,870 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:00:49,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:00:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3132. [2020-02-10 20:00:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:00:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15593 transitions. [2020-02-10 20:00:50,075 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15593 transitions. Word has length 31 [2020-02-10 20:00:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:50,075 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15593 transitions. [2020-02-10 20:00:50,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15593 transitions. [2020-02-10 20:00:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:50,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:50,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:50,080 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:50,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:50,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1978695374, now seen corresponding path program 113 times [2020-02-10 20:00:50,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:50,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404701988] [2020-02-10 20:00:50,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:50,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:50,635 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:00:50,770 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00: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:00:50,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404701988] [2020-02-10 20:00:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:50,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716167761] [2020-02-10 20:00:50,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:50,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:50,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:50,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:50,781 INFO L87 Difference]: Start difference. First operand 3132 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:00:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:51,071 INFO L93 Difference]: Finished difference Result 6089 states and 27012 transitions. [2020-02-10 20:00:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:51,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:51,086 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 20:00:51,086 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:00:51,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:00:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 20:00:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:00:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15608 transitions. [2020-02-10 20:00:51,292 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15608 transitions. Word has length 31 [2020-02-10 20:00:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:51,292 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15608 transitions. [2020-02-10 20:00:51,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15608 transitions. [2020-02-10 20:00:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:51,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:51,297 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:51,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:51,297 INFO L82 PathProgramCache]: Analyzing trace with hash 711238196, now seen corresponding path program 114 times [2020-02-10 20:00:51,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:51,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355495136] [2020-02-10 20:00:51,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:51,857 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:51,990 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:51,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355495136] [2020-02-10 20:00:51,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:51,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:52,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114253967] [2020-02-10 20:00:52,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:52,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:52,000 INFO L87 Difference]: Start difference. First operand 3140 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:00:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:52,220 INFO L93 Difference]: Finished difference Result 6093 states and 27012 transitions. [2020-02-10 20:00:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:52,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:52,236 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:00:52,236 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:00:52,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:00:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3123. [2020-02-10 20:00:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:00:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15569 transitions. [2020-02-10 20:00:52,440 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15569 transitions. Word has length 31 [2020-02-10 20:00:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:52,440 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15569 transitions. [2020-02-10 20:00:52,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15569 transitions. [2020-02-10 20:00:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:52,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:52,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:52,446 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash -679268808, now seen corresponding path program 115 times [2020-02-10 20:00:52,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:52,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544214618] [2020-02-10 20:00:52,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:52,996 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:00:53,125 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:53,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544214618] [2020-02-10 20:00:53,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:53,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:53,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370873312] [2020-02-10 20:00:53,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:53,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:53,136 INFO L87 Difference]: Start difference. First operand 3123 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:00:53,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:53,461 INFO L93 Difference]: Finished difference Result 6071 states and 26979 transitions. [2020-02-10 20:00:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:53,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:53,477 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:00:53,477 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:00:53,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:00:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3136. [2020-02-10 20:00:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:00:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15606 transitions. [2020-02-10 20:00:53,682 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15606 transitions. Word has length 31 [2020-02-10 20:00:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:53,682 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15606 transitions. [2020-02-10 20:00:53,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15606 transitions. [2020-02-10 20:00:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:53,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:53,688 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1524240260, now seen corresponding path program 116 times [2020-02-10 20:00:53,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:53,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733933809] [2020-02-10 20:00:53,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:54,369 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:54,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733933809] [2020-02-10 20:00:54,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:54,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:54,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667831507] [2020-02-10 20:00:54,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:54,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:54,380 INFO L87 Difference]: Start difference. First operand 3136 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:00:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:54,617 INFO L93 Difference]: Finished difference Result 6072 states and 26975 transitions. [2020-02-10 20:00:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:54,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:54,633 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:00:54,633 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:00:54,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:00:54,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3130. [2020-02-10 20:00:54,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:00:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15589 transitions. [2020-02-10 20:00:54,838 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15589 transitions. Word has length 31 [2020-02-10 20:00:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:54,838 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15589 transitions. [2020-02-10 20:00:54,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15589 transitions. [2020-02-10 20:00:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:54,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:54,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:54,844 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:54,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1315735662, now seen corresponding path program 117 times [2020-02-10 20:00:54,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:54,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063765301] [2020-02-10 20:00:54,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:55,380 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:00:55,515 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:55,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063765301] [2020-02-10 20:00:55,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:55,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:55,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232030600] [2020-02-10 20:00:55,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:55,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:55,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:55,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:55,525 INFO L87 Difference]: Start difference. First operand 3130 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:00:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:55,834 INFO L93 Difference]: Finished difference Result 6076 states and 26982 transitions. [2020-02-10 20:00:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:55,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:55,849 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:00:55,850 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:00:55,850 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:55,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:00:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3137. [2020-02-10 20:00:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:00:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15602 transitions. [2020-02-10 20:00:56,055 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15602 transitions. Word has length 31 [2020-02-10 20:00:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:56,055 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15602 transitions. [2020-02-10 20:00:56,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15602 transitions. [2020-02-10 20:00:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:56,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:56,061 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:56,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:56,061 INFO L82 PathProgramCache]: Analyzing trace with hash 866803004, now seen corresponding path program 118 times [2020-02-10 20:00:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:56,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225275404] [2020-02-10 20:00:56,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:56,620 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:56,753 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:56,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:00:56,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225275404] [2020-02-10 20:00:56,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:56,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:56,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919305686] [2020-02-10 20:00:56,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:56,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:56,764 INFO L87 Difference]: Start difference. First operand 3137 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:00:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:56,968 INFO L93 Difference]: Finished difference Result 6081 states and 26985 transitions. [2020-02-10 20:00:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:56,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:56,982 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:00:56,983 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 20:00:56,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 20:00:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 20:00:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:00:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15582 transitions. [2020-02-10 20:00:57,185 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15582 transitions. Word has length 31 [2020-02-10 20:00:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:57,185 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15582 transitions. [2020-02-10 20:00:57,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15582 transitions. [2020-02-10 20:00:57,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:57,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:57,191 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:57,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1709948946, now seen corresponding path program 119 times [2020-02-10 20:00:57,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:57,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190236382] [2020-02-10 20:00:57,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:57,740 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:00:57,875 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:57,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190236382] [2020-02-10 20:00:57,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:57,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:57,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642223076] [2020-02-10 20:00:57,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:57,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:57,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:57,886 INFO L87 Difference]: Start difference. First operand 3130 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:00:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:58,173 INFO L93 Difference]: Finished difference Result 6079 states and 26982 transitions. [2020-02-10 20:00:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:58,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:58,189 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:00:58,189 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:00:58,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:58,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:00:58,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 20:00:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:00:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15597 transitions. [2020-02-10 20:00:58,395 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15597 transitions. Word has length 31 [2020-02-10 20:00:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:58,396 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15597 transitions. [2020-02-10 20:00:58,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15597 transitions. [2020-02-10 20:00:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:58,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:58,402 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 442491768, now seen corresponding path program 120 times [2020-02-10 20:00:58,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:58,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487246050] [2020-02-10 20:00:58,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:00:58,974 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:00:59,105 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:00:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:00:59,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487246050] [2020-02-10 20:00:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:00:59,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:00:59,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467004395] [2020-02-10 20:00:59,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:00:59,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:00:59,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:00:59,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:00:59,115 INFO L87 Difference]: Start difference. First operand 3138 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:00:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:00:59,397 INFO L93 Difference]: Finished difference Result 6083 states and 26982 transitions. [2020-02-10 20:00:59,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:00:59,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:00:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:00:59,413 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:00:59,413 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:00:59,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:00:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:00:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3104. [2020-02-10 20:00:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:00:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15527 transitions. [2020-02-10 20:00:59,621 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15527 transitions. Word has length 31 [2020-02-10 20:00:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:00:59,622 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15527 transitions. [2020-02-10 20:00:59,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:00:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15527 transitions. [2020-02-10 20:00:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:00:59,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:00:59,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:00:59,627 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:00:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:00:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1165855998, now seen corresponding path program 121 times [2020-02-10 20:00:59,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:00:59,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160738340] [2020-02-10 20:00:59,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:00:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:00,175 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:00,308 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:00,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160738340] [2020-02-10 20:01:00,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:00,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:00,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708604060] [2020-02-10 20:01:00,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:00,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:00,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:00,319 INFO L87 Difference]: Start difference. First operand 3104 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:01:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:00,677 INFO L93 Difference]: Finished difference Result 6078 states and 27027 transitions. [2020-02-10 20:01:00,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:00,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:00,693 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:01:00,693 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:01:00,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:01:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3139. [2020-02-10 20:01:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:01:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15656 transitions. [2020-02-10 20:01:00,896 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15656 transitions. Word has length 31 [2020-02-10 20:01:00,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:00,897 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15656 transitions. [2020-02-10 20:01:00,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15656 transitions. [2020-02-10 20:01:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:00,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:00,902 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash -101601180, now seen corresponding path program 122 times [2020-02-10 20:01:00,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:00,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238598744] [2020-02-10 20:01:00,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:01,460 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:01,586 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:01,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238598744] [2020-02-10 20:01:01,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:01,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:01,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638126571] [2020-02-10 20:01:01,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:01,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:01,596 INFO L87 Difference]: Start difference. First operand 3139 states and 15656 transitions. Second operand 12 states. [2020-02-10 20:01:01,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:01,910 INFO L93 Difference]: Finished difference Result 6079 states and 27021 transitions. [2020-02-10 20:01:01,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:01,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:01,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:01,925 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:01:01,925 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:01:01,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:01:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3131. [2020-02-10 20:01:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:01:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15634 transitions. [2020-02-10 20:01:02,138 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15634 transitions. Word has length 31 [2020-02-10 20:01:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:02,138 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15634 transitions. [2020-02-10 20:01:02,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15634 transitions. [2020-02-10 20:01:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:02,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:02,144 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:02,144 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 317233526, now seen corresponding path program 123 times [2020-02-10 20:01:02,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:02,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339243334] [2020-02-10 20:01:02,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:02,701 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:02,835 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:02,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:01:02,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339243334] [2020-02-10 20:01:02,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:02,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:02,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108997134] [2020-02-10 20:01:02,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:02,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:02,847 INFO L87 Difference]: Start difference. First operand 3131 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:01:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:03,088 INFO L93 Difference]: Finished difference Result 6075 states and 27013 transitions. [2020-02-10 20:01:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:03,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:03,103 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:01:03,104 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:01:03,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:01:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3138. [2020-02-10 20:01:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:01:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 20:01:03,305 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 20:01:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:03,305 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 20:01:03,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 20:01:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:03,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:03,310 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:03,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1654800740, now seen corresponding path program 124 times [2020-02-10 20:01:03,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:03,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813250314] [2020-02-10 20:01:03,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:03,881 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:01:04,012 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:04,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:01:04,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813250314] [2020-02-10 20:01:04,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:04,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:04,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894733245] [2020-02-10 20:01:04,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:04,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:04,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:04,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:04,025 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 20:01:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:04,298 INFO L93 Difference]: Finished difference Result 6074 states and 27004 transitions. [2020-02-10 20:01:04,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:04,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:04,312 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:01:04,312 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:01:04,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:01:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3131. [2020-02-10 20:01:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:01:04,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15627 transitions. [2020-02-10 20:01:04,513 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15627 transitions. Word has length 31 [2020-02-10 20:01:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:04,514 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15627 transitions. [2020-02-10 20:01:04,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:04,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15627 transitions. [2020-02-10 20:01:04,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:04,519 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:04,519 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:04,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:04,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1586690506, now seen corresponding path program 125 times [2020-02-10 20:01:04,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:04,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306420024] [2020-02-10 20:01:04,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:05,190 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:05,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:01:05,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306420024] [2020-02-10 20:01:05,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:05,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:05,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973309890] [2020-02-10 20:01:05,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:05,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:05,201 INFO L87 Difference]: Start difference. First operand 3131 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:01:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:05,447 INFO L93 Difference]: Finished difference Result 6077 states and 27010 transitions. [2020-02-10 20:01:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:05,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:05,464 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:01:05,464 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:01:05,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:01:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3138. [2020-02-10 20:01:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:01:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15640 transitions. [2020-02-10 20:01:05,665 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15640 transitions. Word has length 31 [2020-02-10 20:01:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:05,666 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15640 transitions. [2020-02-10 20:01:05,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15640 transitions. [2020-02-10 20:01:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:05,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:05,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:05,672 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1018333886, now seen corresponding path program 126 times [2020-02-10 20:01:05,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:05,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410399483] [2020-02-10 20:01:05,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:06,226 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:01:06,360 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:06,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410399483] [2020-02-10 20:01:06,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:06,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:06,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016483395] [2020-02-10 20:01:06,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:06,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:06,371 INFO L87 Difference]: Start difference. First operand 3138 states and 15640 transitions. Second operand 12 states. [2020-02-10 20:01:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:06,634 INFO L93 Difference]: Finished difference Result 6075 states and 26999 transitions. [2020-02-10 20:01:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:06,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:06,649 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:01:06,649 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:01:06,649 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:01:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3124. [2020-02-10 20:01:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:01:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15607 transitions. [2020-02-10 20:01:06,854 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15607 transitions. Word has length 31 [2020-02-10 20:01:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:06,854 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15607 transitions. [2020-02-10 20:01:06,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15607 transitions. [2020-02-10 20:01:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:06,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:06,860 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1384747292, now seen corresponding path program 127 times [2020-02-10 20:01:06,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:06,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894092684] [2020-02-10 20:01:06,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:07,433 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:07,565 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:07,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894092684] [2020-02-10 20:01:07,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:07,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:07,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644968736] [2020-02-10 20:01:07,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:07,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:07,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:07,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:07,576 INFO L87 Difference]: Start difference. First operand 3124 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:01:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:07,840 INFO L93 Difference]: Finished difference Result 6092 states and 27051 transitions. [2020-02-10 20:01:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:07,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:07,855 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:01:07,856 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 20:01:07,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:08,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 20:01:08,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3143. [2020-02-10 20:01:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:01:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15659 transitions. [2020-02-10 20:01:08,057 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15659 transitions. Word has length 31 [2020-02-10 20:01:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:08,058 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15659 transitions. [2020-02-10 20:01:08,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15659 transitions. [2020-02-10 20:01:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:08,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:08,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:08,063 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1642762826, now seen corresponding path program 128 times [2020-02-10 20:01:08,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:08,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459723900] [2020-02-10 20:01:08,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:08,628 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:08,759 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:08,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:01:08,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459723900] [2020-02-10 20:01:08,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234315267] [2020-02-10 20:01:08,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:08,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:08,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:08,769 INFO L87 Difference]: Start difference. First operand 3143 states and 15659 transitions. Second operand 12 states. [2020-02-10 20:01:09,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:09,005 INFO L93 Difference]: Finished difference Result 6093 states and 27045 transitions. [2020-02-10 20:01:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:09,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:09,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:09,021 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:01:09,021 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:01:09,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:01:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3135. [2020-02-10 20:01:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:01:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15636 transitions. [2020-02-10 20:01:09,225 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15636 transitions. Word has length 31 [2020-02-10 20:01:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:09,225 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15636 transitions. [2020-02-10 20:01:09,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:09,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15636 transitions. [2020-02-10 20:01:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:09,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:09,231 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:09,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1425130678, now seen corresponding path program 129 times [2020-02-10 20:01:09,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:09,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941279727] [2020-02-10 20:01:09,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:09,789 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:09,921 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:09,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941279727] [2020-02-10 20:01:09,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:09,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:09,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171347028] [2020-02-10 20:01:09,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:09,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:09,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:09,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:09,932 INFO L87 Difference]: Start difference. First operand 3135 states and 15636 transitions. Second operand 12 states. [2020-02-10 20:01:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:10,201 INFO L93 Difference]: Finished difference Result 6095 states and 27048 transitions. [2020-02-10 20:01:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:10,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:10,218 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 20:01:10,218 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:01:10,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:10,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:01:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3144. [2020-02-10 20:01:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 20:01:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15653 transitions. [2020-02-10 20:01:10,421 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15653 transitions. Word has length 31 [2020-02-10 20:01:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:10,421 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15653 transitions. [2020-02-10 20:01:10,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15653 transitions. [2020-02-10 20:01:10,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:10,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:10,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:10,426 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1495240714, now seen corresponding path program 130 times [2020-02-10 20:01:10,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:10,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582811713] [2020-02-10 20:01:10,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:10,990 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:01:11,119 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:11,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:01:11,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582811713] [2020-02-10 20:01:11,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:11,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:11,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337045312] [2020-02-10 20:01:11,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:11,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:11,130 INFO L87 Difference]: Start difference. First operand 3144 states and 15653 transitions. Second operand 12 states. [2020-02-10 20:01:11,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:11,391 INFO L93 Difference]: Finished difference Result 6098 states and 27045 transitions. [2020-02-10 20:01:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:11,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:11,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:11,406 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 20:01:11,407 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:01:11,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:01:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3135. [2020-02-10 20:01:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:01:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15627 transitions. [2020-02-10 20:01:11,615 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15627 transitions. Word has length 31 [2020-02-10 20:01:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:11,615 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15627 transitions. [2020-02-10 20:01:11,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15627 transitions. [2020-02-10 20:01:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:11,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:11,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:11,621 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash -478793354, now seen corresponding path program 131 times [2020-02-10 20:01:11,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:11,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477689970] [2020-02-10 20:01:11,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:12,191 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:12,324 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:12,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:01:12,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477689970] [2020-02-10 20:01:12,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:12,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:12,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468022929] [2020-02-10 20:01:12,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:12,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:12,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:12,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:12,333 INFO L87 Difference]: Start difference. First operand 3135 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:01:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:12,589 INFO L93 Difference]: Finished difference Result 6099 states and 27047 transitions. [2020-02-10 20:01:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:12,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:12,604 INFO L225 Difference]: With dead ends: 6099 [2020-02-10 20:01:12,605 INFO L226 Difference]: Without dead ends: 6079 [2020-02-10 20:01:12,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-02-10 20:01:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3146. [2020-02-10 20:01:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 20:01:12,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15647 transitions. [2020-02-10 20:01:12,811 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15647 transitions. Word has length 31 [2020-02-10 20:01:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:12,812 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15647 transitions. [2020-02-10 20:01:12,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15647 transitions. [2020-02-10 20:01:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:12,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:12,817 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 858773860, now seen corresponding path program 132 times [2020-02-10 20:01:12,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:12,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874561660] [2020-02-10 20:01:12,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:13,389 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:01:13,522 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:01:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:13,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874561660] [2020-02-10 20:01:13,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:13,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:13,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55703795] [2020-02-10 20:01:13,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:13,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:13,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:13,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:13,533 INFO L87 Difference]: Start difference. First operand 3146 states and 15647 transitions. Second operand 12 states. [2020-02-10 20:01:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:13,764 INFO L93 Difference]: Finished difference Result 6101 states and 27041 transitions. [2020-02-10 20:01:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:13,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:13,782 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 20:01:13,783 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:01:13,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:01:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3124. [2020-02-10 20:01:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:01:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15597 transitions. [2020-02-10 20:01:14,000 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15597 transitions. Word has length 31 [2020-02-10 20:01:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:14,001 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15597 transitions. [2020-02-10 20:01:14,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:14,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15597 transitions. [2020-02-10 20:01:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:14,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:14,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:14,006 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1524104676, now seen corresponding path program 133 times [2020-02-10 20:01:14,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:14,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164224758] [2020-02-10 20:01:14,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:14,553 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:14,686 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:14,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:01:14,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164224758] [2020-02-10 20:01:14,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:14,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:14,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462717626] [2020-02-10 20:01:14,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:14,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:14,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:14,697 INFO L87 Difference]: Start difference. First operand 3124 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:01:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:14,976 INFO L93 Difference]: Finished difference Result 6080 states and 27013 transitions. [2020-02-10 20:01:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:14,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:14,989 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 20:01:14,990 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:01:14,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:01:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3139. [2020-02-10 20:01:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:01:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15640 transitions. [2020-02-10 20:01:15,191 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15640 transitions. Word has length 31 [2020-02-10 20:01:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:15,191 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15640 transitions. [2020-02-10 20:01:15,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15640 transitions. [2020-02-10 20:01:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:15,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:15,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:15,197 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:15,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:15,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1433295406, now seen corresponding path program 134 times [2020-02-10 20:01:15,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:15,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202945652] [2020-02-10 20:01:15,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:15,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:15,885 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:15,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:01:15,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202945652] [2020-02-10 20:01:15,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:15,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:15,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213046410] [2020-02-10 20:01:15,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:15,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:15,895 INFO L87 Difference]: Start difference. First operand 3139 states and 15640 transitions. Second operand 12 states. [2020-02-10 20:01:16,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:16,193 INFO L93 Difference]: Finished difference Result 6079 states and 27004 transitions. [2020-02-10 20:01:16,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:16,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:16,208 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:01:16,209 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:01:16,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:01:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3132. [2020-02-10 20:01:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:01:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15620 transitions. [2020-02-10 20:01:16,409 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15620 transitions. Word has length 31 [2020-02-10 20:01:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:16,409 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15620 transitions. [2020-02-10 20:01:16,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15620 transitions. [2020-02-10 20:01:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:16,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:16,414 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:16,415 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 887637822, now seen corresponding path program 135 times [2020-02-10 20:01:16,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:16,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848664900] [2020-02-10 20:01:16,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:16,965 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:17,094 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:17,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848664900] [2020-02-10 20:01:17,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482105488] [2020-02-10 20:01:17,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:17,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:17,104 INFO L87 Difference]: Start difference. First operand 3132 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:01:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:17,380 INFO L93 Difference]: Finished difference Result 6086 states and 27018 transitions. [2020-02-10 20:01:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:17,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:17,396 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:01:17,396 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:01:17,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:01:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3141. [2020-02-10 20:01:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:01:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15637 transitions. [2020-02-10 20:01:17,597 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15637 transitions. Word has length 31 [2020-02-10 20:01:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:17,597 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15637 transitions. [2020-02-10 20:01:17,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15637 transitions. [2020-02-10 20:01:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:17,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:17,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:17,602 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 957747858, now seen corresponding path program 136 times [2020-02-10 20:01:17,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:17,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018710997] [2020-02-10 20:01:17,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:18,171 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:01:18,299 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:01:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:18,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018710997] [2020-02-10 20:01:18,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:18,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:18,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662671152] [2020-02-10 20:01:18,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:18,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:18,311 INFO L87 Difference]: Start difference. First operand 3141 states and 15637 transitions. Second operand 12 states. [2020-02-10 20:01:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:18,552 INFO L93 Difference]: Finished difference Result 6089 states and 27015 transitions. [2020-02-10 20:01:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:18,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:18,567 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 20:01:18,567 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 20:01:18,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 20:01:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3132. [2020-02-10 20:01:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:01:18,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15612 transitions. [2020-02-10 20:01:18,767 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15612 transitions. Word has length 31 [2020-02-10 20:01:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:18,768 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15612 transitions. [2020-02-10 20:01:18,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15612 transitions. [2020-02-10 20:01:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:18,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:18,773 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:18,773 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash 740115710, now seen corresponding path program 137 times [2020-02-10 20:01:18,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:18,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303097343] [2020-02-10 20:01:18,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:19,332 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:19,462 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:19,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:01:19,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303097343] [2020-02-10 20:01:19,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:19,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:19,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747386524] [2020-02-10 20:01:19,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:19,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:19,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:19,472 INFO L87 Difference]: Start difference. First operand 3132 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:01:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:19,770 INFO L93 Difference]: Finished difference Result 6083 states and 27003 transitions. [2020-02-10 20:01:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:19,771 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:19,786 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:01:19,786 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:01:19,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:01:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3140. [2020-02-10 20:01:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:01:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15627 transitions. [2020-02-10 20:01:19,992 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15627 transitions. Word has length 31 [2020-02-10 20:01:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:19,992 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15627 transitions. [2020-02-10 20:01:19,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15627 transitions. [2020-02-10 20:01:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:19,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:19,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:19,998 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash -527341468, now seen corresponding path program 138 times [2020-02-10 20:01:19,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:19,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874849910] [2020-02-10 20:01:19,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:20,557 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:01:20,694 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:20,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:01:20,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874849910] [2020-02-10 20:01:20,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:20,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:20,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354201860] [2020-02-10 20:01:20,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:20,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:20,704 INFO L87 Difference]: Start difference. First operand 3140 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:01:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:20,933 INFO L93 Difference]: Finished difference Result 6087 states and 27003 transitions. [2020-02-10 20:01:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:20,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:20,949 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:01:20,949 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:01:20,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:01:21,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3124. [2020-02-10 20:01:21,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:01:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:01:21,152 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:01:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:21,152 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:01:21,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:01:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:21,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:21,158 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1364544650, now seen corresponding path program 139 times [2020-02-10 20:01:21,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:21,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613051276] [2020-02-10 20:01:21,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:21,709 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:21,840 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:21,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:01:21,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613051276] [2020-02-10 20:01:21,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:21,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:21,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889858316] [2020-02-10 20:01:21,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:21,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:21,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:21,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:21,850 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:01:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:22,135 INFO L93 Difference]: Finished difference Result 6086 states and 27017 transitions. [2020-02-10 20:01:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:22,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:22,151 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:01:22,151 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 20:01:22,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 20:01:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3140. [2020-02-10 20:01:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:01:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15634 transitions. [2020-02-10 20:01:22,361 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15634 transitions. Word has length 31 [2020-02-10 20:01:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:22,361 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15634 transitions. [2020-02-10 20:01:22,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15634 transitions. [2020-02-10 20:01:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:22,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:22,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:22,367 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash -325398254, now seen corresponding path program 140 times [2020-02-10 20:01:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900641188] [2020-02-10 20:01:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:23,030 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900641188] [2020-02-10 20:01:23,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:23,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:23,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557982356] [2020-02-10 20:01:23,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:23,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:23,040 INFO L87 Difference]: Start difference. First operand 3140 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:01:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:23,392 INFO L93 Difference]: Finished difference Result 6084 states and 27006 transitions. [2020-02-10 20:01:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:23,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:23,407 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 20:01:23,407 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:01:23,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:01:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3133. [2020-02-10 20:01:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:01:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15614 transitions. [2020-02-10 20:01:23,608 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15614 transitions. Word has length 31 [2020-02-10 20:01:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:23,608 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15614 transitions. [2020-02-10 20:01:23,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:23,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15614 transitions. [2020-02-10 20:01:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:23,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:23,614 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:23,614 INFO L82 PathProgramCache]: Analyzing trace with hash 728077796, now seen corresponding path program 141 times [2020-02-10 20:01:23,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:23,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235652435] [2020-02-10 20:01:23,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:24,182 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:24,310 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:24,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235652435] [2020-02-10 20:01:24,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:24,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:24,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879378404] [2020-02-10 20:01:24,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:24,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:24,320 INFO L87 Difference]: Start difference. First operand 3133 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:01:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:24,679 INFO L93 Difference]: Finished difference Result 6094 states and 27026 transitions. [2020-02-10 20:01:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:24,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:24,694 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 20:01:24,694 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 20:01:24,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 20:01:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3144. [2020-02-10 20:01:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 20:01:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15634 transitions. [2020-02-10 20:01:24,895 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15634 transitions. Word has length 31 [2020-02-10 20:01:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:24,895 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15634 transitions. [2020-02-10 20:01:24,895 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15634 transitions. [2020-02-10 20:01:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:24,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:24,901 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2065645010, now seen corresponding path program 142 times [2020-02-10 20:01:24,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:24,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210601339] [2020-02-10 20:01:24,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:25,467 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:01:25,600 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:01:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:25,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210601339] [2020-02-10 20:01:25,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:25,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:25,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429565422] [2020-02-10 20:01:25,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:25,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:25,610 INFO L87 Difference]: Start difference. First operand 3144 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:01:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:25,857 INFO L93 Difference]: Finished difference Result 6096 states and 27020 transitions. [2020-02-10 20:01:25,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:25,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:25,872 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:01:25,872 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:01:25,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:26,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:01:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3133. [2020-02-10 20:01:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:01:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15605 transitions. [2020-02-10 20:01:26,073 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15605 transitions. Word has length 31 [2020-02-10 20:01:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:26,073 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15605 transitions. [2020-02-10 20:01:26,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15605 transitions. [2020-02-10 20:01:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:26,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:26,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:26,079 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1810487580, now seen corresponding path program 143 times [2020-02-10 20:01:26,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:26,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75377938] [2020-02-10 20:01:26,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:26,755 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:01:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:26,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75377938] [2020-02-10 20:01:26,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:26,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:26,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56635376] [2020-02-10 20:01:26,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:26,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:26,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:26,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:26,766 INFO L87 Difference]: Start difference. First operand 3133 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:01:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:27,120 INFO L93 Difference]: Finished difference Result 6087 states and 27002 transitions. [2020-02-10 20:01:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:27,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:27,135 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:01:27,135 INFO L226 Difference]: Without dead ends: 6069 [2020-02-10 20:01:27,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2020-02-10 20:01:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 3141. [2020-02-10 20:01:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:01:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15620 transitions. [2020-02-10 20:01:27,336 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15620 transitions. Word has length 31 [2020-02-10 20:01:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:27,336 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15620 transitions. [2020-02-10 20:01:27,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15620 transitions. [2020-02-10 20:01:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:27,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:27,342 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:27,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1217022538, now seen corresponding path program 144 times [2020-02-10 20:01:27,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:27,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114964324] [2020-02-10 20:01:27,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:27,910 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:01:28,043 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:01:28,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:01:28,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114964324] [2020-02-10 20:01:28,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:28,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:28,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248351822] [2020-02-10 20:01:28,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:28,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:28,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:28,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:28,053 INFO L87 Difference]: Start difference. First operand 3141 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:01:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:28,232 INFO L93 Difference]: Finished difference Result 6091 states and 27002 transitions. [2020-02-10 20:01:28,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:28,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:28,247 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 20:01:28,247 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:01:28,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:01:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3113. [2020-02-10 20:01:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:01:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15561 transitions. [2020-02-10 20:01:28,448 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15561 transitions. Word has length 31 [2020-02-10 20:01:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:28,448 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15561 transitions. [2020-02-10 20:01:28,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15561 transitions. [2020-02-10 20:01:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:28,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:28,454 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:28,454 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1443947760, now seen corresponding path program 145 times [2020-02-10 20:01:28,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:28,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151131846] [2020-02-10 20:01:28,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:28,988 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:29,123 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:29,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:01:29,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151131846] [2020-02-10 20:01:29,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:29,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:29,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847021125] [2020-02-10 20:01:29,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:29,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:29,134 INFO L87 Difference]: Start difference. First operand 3113 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:01:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:29,387 INFO L93 Difference]: Finished difference Result 6025 states and 26870 transitions. [2020-02-10 20:01:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:29,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:29,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:29,402 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:01:29,402 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:01:29,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:01:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3128. [2020-02-10 20:01:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 20:01:29,604 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 20:01:29,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:29,604 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 20:01:29,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:29,604 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 20:01:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:29,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:29,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:29,609 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:29,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1021462034, now seen corresponding path program 146 times [2020-02-10 20:01:29,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:29,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763480514] [2020-02-10 20:01:29,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:30,147 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:01:30,278 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:30,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:01:30,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763480514] [2020-02-10 20:01:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:30,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:30,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054641446] [2020-02-10 20:01:30,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:30,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:30,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:30,289 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:01:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:30,513 INFO L93 Difference]: Finished difference Result 6022 states and 26859 transitions. [2020-02-10 20:01:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:30,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:30,529 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:01:30,529 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:01:30,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:01:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3123. [2020-02-10 20:01:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15599 transitions. [2020-02-10 20:01:30,730 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15599 transitions. Word has length 31 [2020-02-10 20:01:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:30,730 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15599 transitions. [2020-02-10 20:01:30,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15599 transitions. [2020-02-10 20:01:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:30,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:30,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:30,736 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1019636524, now seen corresponding path program 147 times [2020-02-10 20:01:30,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:30,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880352316] [2020-02-10 20:01:30,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:31,406 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:31,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880352316] [2020-02-10 20:01:31,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:31,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:31,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98600856] [2020-02-10 20:01:31,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:31,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:31,417 INFO L87 Difference]: Start difference. First operand 3123 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:01:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:31,637 INFO L93 Difference]: Finished difference Result 6032 states and 26882 transitions. [2020-02-10 20:01:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:31,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:31,652 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:01:31,652 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:01:31,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:01:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3131. [2020-02-10 20:01:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:01:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 20:01:31,853 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 20:01:31,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:31,853 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 20:01:31,853 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 20:01:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:31,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:31,858 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash -247820654, now seen corresponding path program 148 times [2020-02-10 20:01:31,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:31,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534427246] [2020-02-10 20:01:31,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:32,409 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:32,537 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:32,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:01:32,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534427246] [2020-02-10 20:01:32,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:32,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:32,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865319991] [2020-02-10 20:01:32,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:32,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:32,548 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:01:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:32,777 INFO L93 Difference]: Finished difference Result 6033 states and 26876 transitions. [2020-02-10 20:01:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:32,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:32,793 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:01:32,793 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:01:32,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:01:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3123. [2020-02-10 20:01:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 20:01:32,993 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 20:01:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:32,993 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 20:01:32,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 20:01:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:32,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:32,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:32,999 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:32,999 INFO L82 PathProgramCache]: Analyzing trace with hash 384995180, now seen corresponding path program 149 times [2020-02-10 20:01:32,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:32,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104309202] [2020-02-10 20:01:32,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:33,533 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:01:33,662 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:33,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104309202] [2020-02-10 20:01:33,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:33,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:33,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122989748] [2020-02-10 20:01:33,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:33,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:33,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:33,673 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:01:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:33,953 INFO L93 Difference]: Finished difference Result 6023 states and 26856 transitions. [2020-02-10 20:01:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:33,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:33,969 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:01:33,969 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:01:33,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:34,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:01:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3128. [2020-02-10 20:01:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15603 transitions. [2020-02-10 20:01:34,177 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15603 transitions. Word has length 31 [2020-02-10 20:01:34,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:34,177 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15603 transitions. [2020-02-10 20:01:34,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15603 transitions. [2020-02-10 20:01:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:34,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:34,182 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:34,183 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:34,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:34,183 INFO L82 PathProgramCache]: Analyzing trace with hash -459976272, now seen corresponding path program 150 times [2020-02-10 20:01:34,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:34,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125992540] [2020-02-10 20:01:34,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:34,711 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:34,847 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:34,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:01:34,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125992540] [2020-02-10 20:01:34,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:34,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:34,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602285104] [2020-02-10 20:01:34,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:34,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:34,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:34,858 INFO L87 Difference]: Start difference. First operand 3128 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:01:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:35,092 INFO L93 Difference]: Finished difference Result 6027 states and 26859 transitions. [2020-02-10 20:01:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:35,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:35,108 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:01:35,108 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:01:35,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:01:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3118. [2020-02-10 20:01:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:01:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15580 transitions. [2020-02-10 20:01:35,327 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15580 transitions. Word has length 31 [2020-02-10 20:01:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:35,327 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15580 transitions. [2020-02-10 20:01:35,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15580 transitions. [2020-02-10 20:01:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:35,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:35,332 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:35,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:35,333 INFO L82 PathProgramCache]: Analyzing trace with hash 906454904, now seen corresponding path program 151 times [2020-02-10 20:01:35,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:35,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461961552] [2020-02-10 20:01:35,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:35,871 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:36,004 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:36,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:36,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461961552] [2020-02-10 20:01:36,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:36,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:36,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143983450] [2020-02-10 20:01:36,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:36,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:36,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:36,014 INFO L87 Difference]: Start difference. First operand 3118 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:01:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:36,244 INFO L93 Difference]: Finished difference Result 6022 states and 26858 transitions. [2020-02-10 20:01:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:36,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:36,260 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:01:36,260 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:01:36,260 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:01:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 20:01:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15608 transitions. [2020-02-10 20:01:36,506 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15608 transitions. Word has length 31 [2020-02-10 20:01:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:36,506 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15608 transitions. [2020-02-10 20:01:36,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15608 transitions. [2020-02-10 20:01:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:36,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:36,513 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash 483969178, now seen corresponding path program 152 times [2020-02-10 20:01:36,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:36,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107120453] [2020-02-10 20:01:36,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:37,072 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:01:37,206 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:37,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107120453] [2020-02-10 20:01:37,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:37,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:37,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756512262] [2020-02-10 20:01:37,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:37,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:37,217 INFO L87 Difference]: Start difference. First operand 3128 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:01:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:37,492 INFO L93 Difference]: Finished difference Result 6019 states and 26847 transitions. [2020-02-10 20:01:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:37,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:37,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:37,507 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:01:37,507 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:01:37,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:01:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 20:01:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 20:01:37,713 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 20:01:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:37,713 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 20:01:37,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 20:01:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:37,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:37,718 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:37,718 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -366478804, now seen corresponding path program 153 times [2020-02-10 20:01:37,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:37,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576306762] [2020-02-10 20:01:37,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:38,373 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:38,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:01:38,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576306762] [2020-02-10 20:01:38,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:38,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:38,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672979624] [2020-02-10 20:01:38,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:38,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:38,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:38,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:38,384 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:01:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:38,618 INFO L93 Difference]: Finished difference Result 6026 states and 26863 transitions. [2020-02-10 20:01:38,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:38,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:38,633 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:01:38,633 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:01:38,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:01:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3130. [2020-02-10 20:01:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:01:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 20:01:38,834 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 20:01:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:38,834 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 20:01:38,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:38,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 20:01:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:38,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:38,839 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:38,839 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 971088410, now seen corresponding path program 154 times [2020-02-10 20:01:38,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:38,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371308770] [2020-02-10 20:01:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:39,371 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:01:39,500 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:39,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371308770] [2020-02-10 20:01:39,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:39,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699977811] [2020-02-10 20:01:39,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:39,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:39,510 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:01:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:39,786 INFO L93 Difference]: Finished difference Result 6025 states and 26854 transitions. [2020-02-10 20:01:39,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:39,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:39,801 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:01:39,801 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:01:39,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:01:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 20:01:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15589 transitions. [2020-02-10 20:01:40,005 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15589 transitions. Word has length 31 [2020-02-10 20:01:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:40,005 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15589 transitions. [2020-02-10 20:01:40,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15589 transitions. [2020-02-10 20:01:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:40,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:40,010 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1001120148, now seen corresponding path program 155 times [2020-02-10 20:01:40,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:40,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106605701] [2020-02-10 20:01:40,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:40,561 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:01:40,693 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:40,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:01:40,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106605701] [2020-02-10 20:01:40,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:40,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:40,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898781064] [2020-02-10 20:01:40,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:40,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:40,704 INFO L87 Difference]: Start difference. First operand 3123 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:01:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:40,977 INFO L93 Difference]: Finished difference Result 6018 states and 26840 transitions. [2020-02-10 20:01:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:40,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:40,992 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:01:40,993 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:01:40,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:01:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3128. [2020-02-10 20:01:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:01:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:01:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:41,198 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:01:41,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:01:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:41,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:41,204 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:41,205 INFO L82 PathProgramCache]: Analyzing trace with hash 758932792, now seen corresponding path program 156 times [2020-02-10 20:01:41,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:41,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965911777] [2020-02-10 20:01:41,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:41,736 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:01:41,871 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:41,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965911777] [2020-02-10 20:01:41,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:41,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:41,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066503236] [2020-02-10 20:01:41,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:41,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:41,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:41,882 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:01:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:42,159 INFO L93 Difference]: Finished difference Result 6020 states and 26839 transitions. [2020-02-10 20:01:42,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:42,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:42,175 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:01:42,175 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:01:42,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:42,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:01:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3118. [2020-02-10 20:01:42,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:01:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15575 transitions. [2020-02-10 20:01:42,382 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15575 transitions. Word has length 31 [2020-02-10 20:01:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:42,382 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15575 transitions. [2020-02-10 20:01:42,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15575 transitions. [2020-02-10 20:01:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:42,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:42,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:42,388 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:42,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:42,388 INFO L82 PathProgramCache]: Analyzing trace with hash 213397240, now seen corresponding path program 157 times [2020-02-10 20:01:42,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:42,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373283581] [2020-02-10 20:01:42,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:42,953 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:43,087 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:43,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:01:43,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373283581] [2020-02-10 20:01:43,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:43,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:43,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265028400] [2020-02-10 20:01:43,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:43,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:43,098 INFO L87 Difference]: Start difference. First operand 3118 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:01:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:43,325 INFO L93 Difference]: Finished difference Result 6040 states and 26901 transitions. [2020-02-10 20:01:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:43,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:43,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:43,340 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:01:43,341 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 20:01:43,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 20:01:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3133. [2020-02-10 20:01:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:01:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15617 transitions. [2020-02-10 20:01:43,588 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15617 transitions. Word has length 31 [2020-02-10 20:01:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:43,588 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15617 transitions. [2020-02-10 20:01:43,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:43,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15617 transitions. [2020-02-10 20:01:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:43,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:43,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:43,594 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1054059938, now seen corresponding path program 158 times [2020-02-10 20:01:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:43,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587615122] [2020-02-10 20:01:43,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:44,135 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:44,266 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:44,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587615122] [2020-02-10 20:01:44,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:44,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:44,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595859294] [2020-02-10 20:01:44,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:44,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:44,277 INFO L87 Difference]: Start difference. First operand 3133 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:01:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:44,575 INFO L93 Difference]: Finished difference Result 6041 states and 26895 transitions. [2020-02-10 20:01:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:44,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:44,601 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:01:44,601 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:01:44,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:01:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 20:01:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:01:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15595 transitions. [2020-02-10 20:01:45,048 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15595 transitions. Word has length 31 [2020-02-10 20:01:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:45,048 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15595 transitions. [2020-02-10 20:01:45,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15595 transitions. [2020-02-10 20:01:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:45,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:45,056 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:45,057 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -635225232, now seen corresponding path program 159 times [2020-02-10 20:01:45,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:45,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536975275] [2020-02-10 20:01:45,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:45,635 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:45,768 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:45,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536975275] [2020-02-10 20:01:45,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:45,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210550260] [2020-02-10 20:01:45,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:45,778 INFO L87 Difference]: Start difference. First operand 3125 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:01:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:46,007 INFO L93 Difference]: Finished difference Result 6037 states and 26887 transitions. [2020-02-10 20:01:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:46,008 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:46,022 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:01:46,022 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:01:46,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:01:46,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3132. [2020-02-10 20:01:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:01:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15608 transitions. [2020-02-10 20:01:46,228 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15608 transitions. Word has length 31 [2020-02-10 20:01:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:46,228 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15608 transitions. [2020-02-10 20:01:46,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15608 transitions. [2020-02-10 20:01:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:46,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:46,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:46,233 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash 702341982, now seen corresponding path program 160 times [2020-02-10 20:01:46,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:46,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115242759] [2020-02-10 20:01:46,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:46,788 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:01:46,920 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:01:46,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:01:46,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115242759] [2020-02-10 20:01:46,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:46,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:46,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252489326] [2020-02-10 20:01:46,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:46,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:46,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:46,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:46,930 INFO L87 Difference]: Start difference. First operand 3132 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:01:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:47,170 INFO L93 Difference]: Finished difference Result 6036 states and 26878 transitions. [2020-02-10 20:01:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:47,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:47,185 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:01:47,185 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:01:47,185 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:01:47,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 20:01:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:01:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 20:01:47,389 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 20:01:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:47,389 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 20:01:47,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 20:01:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:47,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:47,394 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1755818032, now seen corresponding path program 161 times [2020-02-10 20:01:47,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:47,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808346653] [2020-02-10 20:01:47,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:47,936 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:48,070 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:48,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808346653] [2020-02-10 20:01:48,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:48,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220855650] [2020-02-10 20:01:48,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:48,080 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:01:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:48,348 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 20:01:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:48,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:48,362 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:01:48,362 INFO L226 Difference]: Without dead ends: 6019 [2020-02-10 20:01:48,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2020-02-10 20:01:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 3132. [2020-02-10 20:01:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:01:48,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 20:01:48,565 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 20:01:48,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:48,565 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 20:01:48,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:48,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 20:01:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:48,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:48,570 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash 65875128, now seen corresponding path program 162 times [2020-02-10 20:01:48,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:48,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222854977] [2020-02-10 20:01:48,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:49,110 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:01:49,240 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:49,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:01:49,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222854977] [2020-02-10 20:01:49,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:49,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:49,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318042498] [2020-02-10 20:01:49,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:49,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:49,250 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:01:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:49,603 INFO L93 Difference]: Finished difference Result 6037 states and 26873 transitions. [2020-02-10 20:01:49,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:49,603 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:49,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:49,618 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:01:49,618 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:01:49,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:01:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3118. [2020-02-10 20:01:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:01:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15570 transitions. [2020-02-10 20:01:49,824 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15570 transitions. Word has length 31 [2020-02-10 20:01:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:49,824 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15570 transitions. [2020-02-10 20:01:49,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:49,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15570 transitions. [2020-02-10 20:01:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:49,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:49,830 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:49,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1591866330, now seen corresponding path program 163 times [2020-02-10 20:01:49,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:49,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131552966] [2020-02-10 20:01:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:50,349 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:50,479 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:50,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131552966] [2020-02-10 20:01:50,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:50,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:50,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513678488] [2020-02-10 20:01:50,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:50,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:50,489 INFO L87 Difference]: Start difference. First operand 3118 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:01:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:50,816 INFO L93 Difference]: Finished difference Result 6021 states and 26846 transitions. [2020-02-10 20:01:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:50,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:50,835 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:01:50,835 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:01:50,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:01:51,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3128. [2020-02-10 20:01:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:01:51,044 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:01:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:51,044 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:01:51,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:01:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:51,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:51,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:51,096 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:51,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash 746894878, now seen corresponding path program 164 times [2020-02-10 20:01:51,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:51,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236565036] [2020-02-10 20:01:51,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:51,612 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:51,737 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:51,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:01:51,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236565036] [2020-02-10 20:01:51,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:51,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:51,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635460999] [2020-02-10 20:01:51,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:51,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:51,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:51,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:51,747 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:01:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:52,031 INFO L93 Difference]: Finished difference Result 6025 states and 26849 transitions. [2020-02-10 20:01:52,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:52,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:52,046 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:01:52,047 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:01:52,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:01:52,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 20:01:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15584 transitions. [2020-02-10 20:01:52,246 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15584 transitions. Word has length 31 [2020-02-10 20:01:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:52,246 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15584 transitions. [2020-02-10 20:01:52,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15584 transitions. [2020-02-10 20:01:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:52,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:52,252 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash 743243858, now seen corresponding path program 165 times [2020-02-10 20:01:52,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:52,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660240260] [2020-02-10 20:01:52,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:52,782 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:52,914 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:52,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:01:52,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660240260] [2020-02-10 20:01:52,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:52,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:52,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544497744] [2020-02-10 20:01:52,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:52,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:52,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:52,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:52,924 INFO L87 Difference]: Start difference. First operand 3123 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:01:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:53,169 INFO L93 Difference]: Finished difference Result 6019 states and 26837 transitions. [2020-02-10 20:01:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:53,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:53,184 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:01:53,184 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:01:53,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:01:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 20:01:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:01:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15593 transitions. [2020-02-10 20:01:53,390 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15593 transitions. Word has length 31 [2020-02-10 20:01:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:53,391 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15593 transitions. [2020-02-10 20:01:53,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15593 transitions. [2020-02-10 20:01:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:53,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:53,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:53,396 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:53,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1791670498, now seen corresponding path program 166 times [2020-02-10 20:01:53,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:53,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741111455] [2020-02-10 20:01:53,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:53,916 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:01:54,048 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:54,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:54,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741111455] [2020-02-10 20:01:54,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:54,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:54,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705762407] [2020-02-10 20:01:54,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:54,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:54,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:54,061 INFO L87 Difference]: Start difference. First operand 3128 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:01:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:54,302 INFO L93 Difference]: Finished difference Result 6021 states and 26836 transitions. [2020-02-10 20:01:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:54,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:54,317 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:01:54,317 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:01:54,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:01:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 20:01:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:01:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 20:01:54,519 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 20:01:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:54,519 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 20:01:54,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 20:01:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:54,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:54,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:54,525 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash -526038830, now seen corresponding path program 167 times [2020-02-10 20:01:54,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:54,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788968945] [2020-02-10 20:01:54,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:55,054 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:01:55,183 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:55,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:01:55,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788968945] [2020-02-10 20:01:55,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:55,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:55,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759855265] [2020-02-10 20:01:55,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:55,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:55,194 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:01:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:55,416 INFO L93 Difference]: Finished difference Result 6029 states and 26854 transitions. [2020-02-10 20:01:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:55,416 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:55,430 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:01:55,430 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:01:55,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:01:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3130. [2020-02-10 20:01:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:01:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15592 transitions. [2020-02-10 20:01:55,633 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15592 transitions. Word has length 31 [2020-02-10 20:01:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:55,634 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15592 transitions. [2020-02-10 20:01:55,634 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15592 transitions. [2020-02-10 20:01:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:55,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:55,639 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2078985562, now seen corresponding path program 168 times [2020-02-10 20:01:55,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:55,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141793703] [2020-02-10 20:01:55,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:56,159 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:01:56,288 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:01:56,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:01:56,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141793703] [2020-02-10 20:01:56,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:56,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:56,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276194053] [2020-02-10 20:01:56,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:56,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:56,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:56,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:56,299 INFO L87 Difference]: Start difference. First operand 3130 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:01:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:56,516 INFO L93 Difference]: Finished difference Result 6027 states and 26843 transitions. [2020-02-10 20:01:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:56,516 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:56,531 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:01:56,531 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:01:56,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:01:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3113. [2020-02-10 20:01:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:01:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15556 transitions. [2020-02-10 20:01:56,738 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15556 transitions. Word has length 31 [2020-02-10 20:01:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:56,738 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15556 transitions. [2020-02-10 20:01:56,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15556 transitions. [2020-02-10 20:01:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:56,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:56,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:56,743 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash -315342902, now seen corresponding path program 169 times [2020-02-10 20:01:56,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:56,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927066907] [2020-02-10 20:01:56,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:57,312 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:57,446 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927066907] [2020-02-10 20:01:57,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:57,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:57,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752440167] [2020-02-10 20:01:57,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:57,457 INFO L87 Difference]: Start difference. First operand 3113 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:01:57,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:57,706 INFO L93 Difference]: Finished difference Result 6046 states and 26915 transitions. [2020-02-10 20:01:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:57,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:57,721 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:01:57,721 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:01:57,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:01:57,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3131. [2020-02-10 20:01:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:01:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15617 transitions. [2020-02-10 20:01:57,926 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15617 transitions. Word has length 31 [2020-02-10 20:01:57,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:57,926 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15617 transitions. [2020-02-10 20:01:57,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15617 transitions. [2020-02-10 20:01:57,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:57,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:57,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:57,932 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash -737828628, now seen corresponding path program 170 times [2020-02-10 20:01:57,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:57,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68139188] [2020-02-10 20:01:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:58,526 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:01:58,656 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:58,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:01:58,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68139188] [2020-02-10 20:01:58,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:58,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:58,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297601106] [2020-02-10 20:01:58,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:58,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:58,667 INFO L87 Difference]: Start difference. First operand 3131 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:01:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:01:58,918 INFO L93 Difference]: Finished difference Result 6043 states and 26904 transitions. [2020-02-10 20:01:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:01:58,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:01:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:01:58,932 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:01:58,932 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:01:58,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:01:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:01:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 20:01:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:01:59,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15603 transitions. [2020-02-10 20:01:59,134 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15603 transitions. Word has length 31 [2020-02-10 20:01:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:01:59,134 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15603 transitions. [2020-02-10 20:01:59,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:01:59,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15603 transitions. [2020-02-10 20:01:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:01:59,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:01:59,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:01:59,139 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:01:59,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:01:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash -739654138, now seen corresponding path program 171 times [2020-02-10 20:01:59,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:01:59,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70313651] [2020-02-10 20:01:59,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:01:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:01:59,675 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:01:59,807 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:01:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:01:59,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70313651] [2020-02-10 20:01:59,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:01:59,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:01:59,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375643950] [2020-02-10 20:01:59,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:01:59,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:01:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:01:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:01:59,817 INFO L87 Difference]: Start difference. First operand 3126 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:02:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:00,072 INFO L93 Difference]: Finished difference Result 6053 states and 26927 transitions. [2020-02-10 20:02:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:00,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:00,088 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:02:00,088 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:02:00,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:00,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:02:00,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3134. [2020-02-10 20:02:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:02:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 20:02:00,293 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 20:02:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:00,293 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 20:02:00,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 20:02:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:00,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:00,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:00,299 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:00,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2007111316, now seen corresponding path program 172 times [2020-02-10 20:02:00,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:00,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96691488] [2020-02-10 20:02:00,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:00,846 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:00,976 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:00,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:00,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96691488] [2020-02-10 20:02:00,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:00,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:00,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040149736] [2020-02-10 20:02:00,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:00,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:00,987 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:02:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:01,227 INFO L93 Difference]: Finished difference Result 6054 states and 26921 transitions. [2020-02-10 20:02:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:01,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:01,243 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:02:01,243 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:02:01,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:02:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3126. [2020-02-10 20:02:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:02:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15598 transitions. [2020-02-10 20:02:01,449 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15598 transitions. Word has length 31 [2020-02-10 20:02:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:01,449 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15598 transitions. [2020-02-10 20:02:01,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15598 transitions. [2020-02-10 20:02:01,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:01,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:01,455 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:01,455 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1374295482, now seen corresponding path program 173 times [2020-02-10 20:02:01,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:01,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350228868] [2020-02-10 20:02:01,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:02,000 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:02:02,134 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:02,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:02:02,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350228868] [2020-02-10 20:02:02,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:02,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:02,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964159277] [2020-02-10 20:02:02,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:02,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:02,144 INFO L87 Difference]: Start difference. First operand 3126 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:02:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:02,381 INFO L93 Difference]: Finished difference Result 6044 states and 26901 transitions. [2020-02-10 20:02:02,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:02,381 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:02,396 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:02:02,396 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:02:02,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:02:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3131. [2020-02-10 20:02:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:02:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 20:02:02,598 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 20:02:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:02,598 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 20:02:02,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 20:02:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:02,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:02,603 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2075700362, now seen corresponding path program 174 times [2020-02-10 20:02:02,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:02,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763044417] [2020-02-10 20:02:02,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:03,140 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:03,271 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:03,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:02:03,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763044417] [2020-02-10 20:02:03,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:03,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:03,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159183027] [2020-02-10 20:02:03,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:03,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:03,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:03,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:03,282 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:02:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:03,519 INFO L93 Difference]: Finished difference Result 6048 states and 26904 transitions. [2020-02-10 20:02:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:03,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:03,534 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:02:03,534 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:02:03,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:02:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3121. [2020-02-10 20:02:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:02:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15584 transitions. [2020-02-10 20:02:03,736 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15584 transitions. Word has length 31 [2020-02-10 20:02:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:03,736 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15584 transitions. [2020-02-10 20:02:03,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15584 transitions. [2020-02-10 20:02:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:03,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:03,741 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:03,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 891528248, now seen corresponding path program 175 times [2020-02-10 20:02:03,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:03,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171353373] [2020-02-10 20:02:03,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:04,291 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:04,426 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:04,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:02:04,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171353373] [2020-02-10 20:02:04,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:04,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:04,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692841885] [2020-02-10 20:02:04,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:04,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:04,436 INFO L87 Difference]: Start difference. First operand 3121 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:02:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:04,675 INFO L93 Difference]: Finished difference Result 6051 states and 26920 transitions. [2020-02-10 20:02:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:04,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:04,689 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:02:04,689 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:02:04,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:02:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3132. [2020-02-10 20:02:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:02:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15615 transitions. [2020-02-10 20:02:04,890 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15615 transitions. Word has length 31 [2020-02-10 20:02:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:04,890 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15615 transitions. [2020-02-10 20:02:04,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15615 transitions. [2020-02-10 20:02:04,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:04,895 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:04,896 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:04,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:04,896 INFO L82 PathProgramCache]: Analyzing trace with hash 469042522, now seen corresponding path program 176 times [2020-02-10 20:02:04,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:04,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472760871] [2020-02-10 20:02:04,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:05,494 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:02:05,624 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:05,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:02:05,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472760871] [2020-02-10 20:02:05,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:05,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:05,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694836670] [2020-02-10 20:02:05,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:05,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:05,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:05,635 INFO L87 Difference]: Start difference. First operand 3132 states and 15615 transitions. Second operand 12 states. [2020-02-10 20:02:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:05,911 INFO L93 Difference]: Finished difference Result 6048 states and 26909 transitions. [2020-02-10 20:02:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:05,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:05,926 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:02:05,926 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:02:05,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:02:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3127. [2020-02-10 20:02:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:02:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 20:02:06,133 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 20:02:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:06,133 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 20:02:06,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 20:02:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:06,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:06,138 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:06,138 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1017872314, now seen corresponding path program 177 times [2020-02-10 20:02:06,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:06,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077411612] [2020-02-10 20:02:06,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:06,802 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:06,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:02:06,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077411612] [2020-02-10 20:02:06,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:06,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:06,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247395818] [2020-02-10 20:02:06,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:06,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:06,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:06,812 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:02:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:07,109 INFO L93 Difference]: Finished difference Result 6061 states and 26937 transitions. [2020-02-10 20:02:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:07,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:07,124 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:02:07,125 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:02:07,125 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:02:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3136. [2020-02-10 20:02:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:02:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15618 transitions. [2020-02-10 20:02:07,330 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15618 transitions. Word has length 31 [2020-02-10 20:02:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:07,330 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15618 transitions. [2020-02-10 20:02:07,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15618 transitions. [2020-02-10 20:02:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:07,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:07,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:07,335 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash -947762278, now seen corresponding path program 178 times [2020-02-10 20:02:07,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:07,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743861017] [2020-02-10 20:02:07,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:07,887 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:08,014 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:08,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:02:08,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743861017] [2020-02-10 20:02:08,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:08,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:08,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819586068] [2020-02-10 20:02:08,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:08,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:08,024 INFO L87 Difference]: Start difference. First operand 3136 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:02:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:08,229 INFO L93 Difference]: Finished difference Result 6064 states and 26934 transitions. [2020-02-10 20:02:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:08,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:08,244 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:02:08,244 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:02:08,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:02:08,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3127. [2020-02-10 20:02:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:02:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 20:02:08,451 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 20:02:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:08,451 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 20:02:08,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 20:02:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:08,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:08,457 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:08,457 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1652513658, now seen corresponding path program 179 times [2020-02-10 20:02:08,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:08,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239805630] [2020-02-10 20:02:08,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:09,005 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:02:09,139 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:09,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:02:09,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239805630] [2020-02-10 20:02:09,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:09,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929140343] [2020-02-10 20:02:09,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:09,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:09,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:09,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:09,149 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:02:09,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:09,407 INFO L93 Difference]: Finished difference Result 6052 states and 26910 transitions. [2020-02-10 20:02:09,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:09,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:09,422 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:02:09,422 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:02:09,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:02:09,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 20:02:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:02:09,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15606 transitions. [2020-02-10 20:02:09,629 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15606 transitions. Word has length 31 [2020-02-10 20:02:09,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:09,629 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15606 transitions. [2020-02-10 20:02:09,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15606 transitions. [2020-02-10 20:02:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:09,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:09,635 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1159917896, now seen corresponding path program 180 times [2020-02-10 20:02:09,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:09,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301415024] [2020-02-10 20:02:09,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:10,183 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:10,315 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:10,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301415024] [2020-02-10 20:02:10,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:10,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:10,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471809963] [2020-02-10 20:02:10,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:10,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:10,326 INFO L87 Difference]: Start difference. First operand 3133 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:02:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:10,590 INFO L93 Difference]: Finished difference Result 6058 states and 26916 transitions. [2020-02-10 20:02:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:10,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:10,605 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:02:10,605 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:02:10,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:10,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:02:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3121. [2020-02-10 20:02:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:02:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 20:02:10,811 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 20:02:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:10,812 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 20:02:10,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 20:02:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:10,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:10,817 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:10,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 198470584, now seen corresponding path program 181 times [2020-02-10 20:02:10,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:10,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730405972] [2020-02-10 20:02:10,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:11,382 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:11,513 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:02:11,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:02:11,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730405972] [2020-02-10 20:02:11,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:11,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:11,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769161050] [2020-02-10 20:02:11,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:11,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:11,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:11,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:11,524 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:02:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:11,816 INFO L93 Difference]: Finished difference Result 6075 states and 26976 transitions. [2020-02-10 20:02:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:11,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:11,831 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:02:11,832 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:02:11,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:02:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3140. [2020-02-10 20:02:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:02:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15630 transitions. [2020-02-10 20:02:12,034 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15630 transitions. Word has length 31 [2020-02-10 20:02:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:12,035 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15630 transitions. [2020-02-10 20:02:12,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15630 transitions. [2020-02-10 20:02:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:12,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:12,040 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:12,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1068986594, now seen corresponding path program 182 times [2020-02-10 20:02:12,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:12,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800493921] [2020-02-10 20:02:12,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:12,607 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:12,737 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:12,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:02:12,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800493921] [2020-02-10 20:02:12,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:12,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:12,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835465215] [2020-02-10 20:02:12,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:12,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:12,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:12,748 INFO L87 Difference]: Start difference. First operand 3140 states and 15630 transitions. Second operand 12 states. [2020-02-10 20:02:13,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:13,099 INFO L93 Difference]: Finished difference Result 6076 states and 26970 transitions. [2020-02-10 20:02:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:13,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:13,115 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:02:13,115 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:02:13,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:02:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 20:02:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:02:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15607 transitions. [2020-02-10 20:02:13,316 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15607 transitions. Word has length 31 [2020-02-10 20:02:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:13,317 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15607 transitions. [2020-02-10 20:02:13,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15607 transitions. [2020-02-10 20:02:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:13,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:13,322 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:13,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:13,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1286618742, now seen corresponding path program 183 times [2020-02-10 20:02:13,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:13,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840976210] [2020-02-10 20:02:13,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:13,907 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:14,034 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:14,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:02:14,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840976210] [2020-02-10 20:02:14,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:14,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:14,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833133103] [2020-02-10 20:02:14,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:14,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:14,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:14,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:14,044 INFO L87 Difference]: Start difference. First operand 3132 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:02:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:14,408 INFO L93 Difference]: Finished difference Result 6078 states and 26973 transitions. [2020-02-10 20:02:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:14,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:14,422 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:02:14,423 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:02:14,423 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:02:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3141. [2020-02-10 20:02:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:02:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15624 transitions. [2020-02-10 20:02:14,629 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15624 transitions. Word has length 31 [2020-02-10 20:02:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:14,629 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15624 transitions. [2020-02-10 20:02:14,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15624 transitions. [2020-02-10 20:02:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:14,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:14,635 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1216508706, now seen corresponding path program 184 times [2020-02-10 20:02:14,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:14,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834597522] [2020-02-10 20:02:14,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:15,196 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:15,326 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:15,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:02:15,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834597522] [2020-02-10 20:02:15,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:15,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:15,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491064772] [2020-02-10 20:02:15,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:15,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:15,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:15,337 INFO L87 Difference]: Start difference. First operand 3141 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:02:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:15,652 INFO L93 Difference]: Finished difference Result 6081 states and 26970 transitions. [2020-02-10 20:02:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:15,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:15,667 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:02:15,667 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:02:15,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:02:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3132. [2020-02-10 20:02:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:02:15,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15598 transitions. [2020-02-10 20:02:15,878 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15598 transitions. Word has length 31 [2020-02-10 20:02:15,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:15,878 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15598 transitions. [2020-02-10 20:02:15,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:15,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15598 transitions. [2020-02-10 20:02:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:15,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:15,883 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:15,883 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1104424522, now seen corresponding path program 185 times [2020-02-10 20:02:15,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:15,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732149219] [2020-02-10 20:02:15,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:16,440 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:16,570 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:16,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732149219] [2020-02-10 20:02:16,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:16,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:16,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339231087] [2020-02-10 20:02:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:16,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:16,580 INFO L87 Difference]: Start difference. First operand 3132 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:02:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:16,871 INFO L93 Difference]: Finished difference Result 6082 states and 26972 transitions. [2020-02-10 20:02:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:16,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:16,887 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:02:16,887 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:02:16,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:02:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3143. [2020-02-10 20:02:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:02:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15618 transitions. [2020-02-10 20:02:17,095 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15618 transitions. Word has length 31 [2020-02-10 20:02:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:17,095 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15618 transitions. [2020-02-10 20:02:17,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15618 transitions. [2020-02-10 20:02:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:17,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:17,100 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:17,100 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1852975560, now seen corresponding path program 186 times [2020-02-10 20:02:17,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:17,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835301291] [2020-02-10 20:02:17,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:17,678 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:17,813 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:02:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:17,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835301291] [2020-02-10 20:02:17,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:17,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:17,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480188723] [2020-02-10 20:02:17,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:17,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:17,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:17,824 INFO L87 Difference]: Start difference. First operand 3143 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:02:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:18,017 INFO L93 Difference]: Finished difference Result 6084 states and 26966 transitions. [2020-02-10 20:02:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:18,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:18,032 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 20:02:18,032 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:02:18,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:02:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3121. [2020-02-10 20:02:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:02:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:02:18,233 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:02:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:18,233 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:02:18,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:02:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:18,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:18,238 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1576939674, now seen corresponding path program 187 times [2020-02-10 20:02:18,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:18,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932223876] [2020-02-10 20:02:18,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:18,791 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:02:18,920 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:18,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:02:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932223876] [2020-02-10 20:02:18,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:18,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:18,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655118767] [2020-02-10 20:02:18,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:18,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:18,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:18,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:18,930 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:02:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:19,152 INFO L93 Difference]: Finished difference Result 6053 states and 26910 transitions. [2020-02-10 20:02:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:19,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:19,168 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:02:19,168 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:02:19,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:02:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 20:02:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:02:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15603 transitions. [2020-02-10 20:02:19,376 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15603 transitions. Word has length 31 [2020-02-10 20:02:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:19,376 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15603 transitions. [2020-02-10 20:02:19,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15603 transitions. [2020-02-10 20:02:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:19,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:19,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:19,381 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:19,381 INFO L82 PathProgramCache]: Analyzing trace with hash 731968222, now seen corresponding path program 188 times [2020-02-10 20:02:19,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:19,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053732476] [2020-02-10 20:02:19,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:19,931 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:20,064 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02:20,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:02:20,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053732476] [2020-02-10 20:02:20,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:20,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:20,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082414544] [2020-02-10 20:02:20,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:20,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:20,075 INFO L87 Difference]: Start difference. First operand 3133 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:02:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:20,300 INFO L93 Difference]: Finished difference Result 6057 states and 26913 transitions. [2020-02-10 20:02:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:20,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:20,316 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:02:20,316 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:02:20,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:02:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3128. [2020-02-10 20:02:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:02:20,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 20:02:20,556 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 20:02:20,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:20,556 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 20:02:20,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 20:02:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:20,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:20,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:20,561 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash 91850348, now seen corresponding path program 189 times [2020-02-10 20:02:20,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:20,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008264813] [2020-02-10 20:02:20,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:21,091 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:02:21,221 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:02:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:21,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008264813] [2020-02-10 20:02:21,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:21,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:21,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630633573] [2020-02-10 20:02:21,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:21,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:21,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:21,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:21,232 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:02:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:21,446 INFO L93 Difference]: Finished difference Result 6056 states and 26910 transitions. [2020-02-10 20:02:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:21,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:21,461 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:02:21,461 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:02:21,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:21,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:02:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3134. [2020-02-10 20:02:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:02:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15600 transitions. [2020-02-10 20:02:21,664 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15600 transitions. Word has length 31 [2020-02-10 20:02:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:21,664 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15600 transitions. [2020-02-10 20:02:21,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15600 transitions. [2020-02-10 20:02:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:21,669 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:21,669 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash 584446110, now seen corresponding path program 190 times [2020-02-10 20:02:21,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:21,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178538123] [2020-02-10 20:02:21,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:22,227 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:22,358 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:02:22,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:02:22,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178538123] [2020-02-10 20:02:22,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:22,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:22,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968928059] [2020-02-10 20:02:22,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:22,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:22,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:22,369 INFO L87 Difference]: Start difference. First operand 3134 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:02:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:22,548 INFO L93 Difference]: Finished difference Result 6062 states and 26916 transitions. [2020-02-10 20:02:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:22,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:22,564 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:02:22,564 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:02:22,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:02:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3128. [2020-02-10 20:02:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:02:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:02:22,770 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:02:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:22,770 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:02:22,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:02:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:22,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:22,776 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1177432340, now seen corresponding path program 191 times [2020-02-10 20:02:22,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:22,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109004741] [2020-02-10 20:02:22,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:23,326 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:23,460 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:02: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:02:23,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109004741] [2020-02-10 20:02:23,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:23,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:23,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937904887] [2020-02-10 20:02:23,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:23,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:23,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:23,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:23,470 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:02:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:23,684 INFO L93 Difference]: Finished difference Result 6069 states and 26933 transitions. [2020-02-10 20:02:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:23,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:23,700 INFO L225 Difference]: With dead ends: 6069 [2020-02-10 20:02:23,700 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:02:23,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:23,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:02:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3139. [2020-02-10 20:02:23,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:02:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15603 transitions. [2020-02-10 20:02:23,903 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15603 transitions. Word has length 31 [2020-02-10 20:02:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:23,904 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15603 transitions. [2020-02-10 20:02:23,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15603 transitions. [2020-02-10 20:02:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:23,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:23,909 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:23,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:23,909 INFO L82 PathProgramCache]: Analyzing trace with hash 160134874, now seen corresponding path program 192 times [2020-02-10 20:02:23,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:23,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558831473] [2020-02-10 20:02:23,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:24,469 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:24,596 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:02:24,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:02:24,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558831473] [2020-02-10 20:02:24,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:24,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:24,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756071662] [2020-02-10 20:02:24,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:24,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:24,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:24,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:24,607 INFO L87 Difference]: Start difference. First operand 3139 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:02:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:24,833 INFO L93 Difference]: Finished difference Result 6071 states and 26927 transitions. [2020-02-10 20:02:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:24,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:24,847 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:02:24,848 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:02:24,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:02:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3113. [2020-02-10 20:02:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:02:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15548 transitions. [2020-02-10 20:02:25,053 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15548 transitions. Word has length 31 [2020-02-10 20:02:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:25,053 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15548 transitions. [2020-02-10 20:02:25,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15548 transitions. [2020-02-10 20:02:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:25,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:25,059 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:25,059 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:25,059 INFO L82 PathProgramCache]: Analyzing trace with hash -335245110, now seen corresponding path program 193 times [2020-02-10 20:02:25,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:25,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248833923] [2020-02-10 20:02:25,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:25,592 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:25,726 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:25,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:02:25,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248833923] [2020-02-10 20:02:25,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:25,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:25,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351729639] [2020-02-10 20:02:25,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:25,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:25,736 INFO L87 Difference]: Start difference. First operand 3113 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:02:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:25,963 INFO L93 Difference]: Finished difference Result 6031 states and 26872 transitions. [2020-02-10 20:02:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:25,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:25,978 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:02:25,978 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:02:25,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:02:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3129. [2020-02-10 20:02:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:02:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15604 transitions. [2020-02-10 20:02:26,185 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15604 transitions. Word has length 31 [2020-02-10 20:02:26,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:26,185 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15604 transitions. [2020-02-10 20:02:26,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15604 transitions. [2020-02-10 20:02:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:26,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:26,190 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -757730836, now seen corresponding path program 194 times [2020-02-10 20:02:26,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:26,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147326185] [2020-02-10 20:02:26,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:26,726 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:02:26,857 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:26,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147326185] [2020-02-10 20:02:26,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:26,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:26,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303185925] [2020-02-10 20:02:26,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:26,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:26,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:26,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:26,866 INFO L87 Difference]: Start difference. First operand 3129 states and 15604 transitions. Second operand 12 states. [2020-02-10 20:02:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:27,096 INFO L93 Difference]: Finished difference Result 6028 states and 26861 transitions. [2020-02-10 20:02:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:27,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:27,111 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:02:27,111 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:02:27,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:02:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 20:02:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:02:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15590 transitions. [2020-02-10 20:02:27,312 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15590 transitions. Word has length 31 [2020-02-10 20:02:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:27,312 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15590 transitions. [2020-02-10 20:02:27,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15590 transitions. [2020-02-10 20:02:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:27,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:27,317 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:27,317 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1608178818, now seen corresponding path program 195 times [2020-02-10 20:02:27,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:27,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859655465] [2020-02-10 20:02:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:27,460 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2020-02-10 20:02:28,012 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:28,146 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:28,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:02:28,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859655465] [2020-02-10 20:02:28,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:28,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:28,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987352007] [2020-02-10 20:02:28,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:28,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:28,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:28,157 INFO L87 Difference]: Start difference. First operand 3124 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:02:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:28,386 INFO L93 Difference]: Finished difference Result 6035 states and 26877 transitions. [2020-02-10 20:02:28,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:28,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:28,402 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:02:28,402 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:02:28,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:02:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3131. [2020-02-10 20:02:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:02:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15603 transitions. [2020-02-10 20:02:28,607 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15603 transitions. Word has length 31 [2020-02-10 20:02:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:28,607 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15603 transitions. [2020-02-10 20:02:28,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15603 transitions. [2020-02-10 20:02:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:28,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:28,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:28,613 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:28,613 INFO L82 PathProgramCache]: Analyzing trace with hash -270611604, now seen corresponding path program 196 times [2020-02-10 20:02:28,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:28,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506065082] [2020-02-10 20:02:28,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:29,150 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:29,282 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:29,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:02:29,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506065082] [2020-02-10 20:02:29,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:29,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:29,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778475342] [2020-02-10 20:02:29,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:29,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:29,293 INFO L87 Difference]: Start difference. First operand 3131 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:02:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:29,572 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 20:02:29,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:29,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:29,587 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:02:29,587 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:02:29,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:02:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3124. [2020-02-10 20:02:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:02:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15585 transitions. [2020-02-10 20:02:29,793 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15585 transitions. Word has length 31 [2020-02-10 20:02:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:29,793 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15585 transitions. [2020-02-10 20:02:29,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15585 transitions. [2020-02-10 20:02:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:29,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:29,799 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:29,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2052147134, now seen corresponding path program 197 times [2020-02-10 20:02:29,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:29,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414101582] [2020-02-10 20:02:29,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:30,329 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:30,462 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:30,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:02:30,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414101582] [2020-02-10 20:02:30,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:30,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:30,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296778138] [2020-02-10 20:02:30,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:30,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:30,472 INFO L87 Difference]: Start difference. First operand 3124 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:02:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:30,701 INFO L93 Difference]: Finished difference Result 6027 states and 26854 transitions. [2020-02-10 20:02:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:30,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:30,717 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:02:30,717 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:02:30,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:02:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3129. [2020-02-10 20:02:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:02:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 20:02:30,918 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 20:02:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:30,918 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 20:02:30,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 20:02:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:30,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:30,923 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:30,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:30,923 INFO L82 PathProgramCache]: Analyzing trace with hash -482767222, now seen corresponding path program 198 times [2020-02-10 20:02:30,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:30,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742510349] [2020-02-10 20:02:30,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:31,463 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:31,593 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:31,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742510349] [2020-02-10 20:02:31,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:31,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:31,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107121215] [2020-02-10 20:02:31,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:31,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:31,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:31,604 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:02:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:31,847 INFO L93 Difference]: Finished difference Result 6029 states and 26853 transitions. [2020-02-10 20:02:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:31,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:31,862 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:02:31,863 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:02:31,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:02:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 20:02:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:02:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15571 transitions. [2020-02-10 20:02:32,063 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15571 transitions. Word has length 31 [2020-02-10 20:02:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:32,064 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15571 transitions. [2020-02-10 20:02:32,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15571 transitions. [2020-02-10 20:02:32,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:32,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:32,069 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:32,069 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:32,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1409118896, now seen corresponding path program 199 times [2020-02-10 20:02:32,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:32,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664565072] [2020-02-10 20:02:32,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:32,607 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:32,741 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:32,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664565072] [2020-02-10 20:02:32,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:32,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:32,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505945492] [2020-02-10 20:02:32,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:32,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:32,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:32,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:32,753 INFO L87 Difference]: Start difference. First operand 3119 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:02:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:32,985 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 20:02:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:32,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:33,000 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:02:33,000 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:02:33,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:02:33,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 20:02:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:02:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15602 transitions. [2020-02-10 20:02:33,201 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15602 transitions. Word has length 31 [2020-02-10 20:02:33,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:33,201 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15602 transitions. [2020-02-10 20:02:33,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15602 transitions. [2020-02-10 20:02:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:33,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:33,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:33,207 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 986633170, now seen corresponding path program 200 times [2020-02-10 20:02:33,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:33,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345582614] [2020-02-10 20:02:33,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:33,866 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:33,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:02:33,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345582614] [2020-02-10 20:02:33,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:33,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:33,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312415793] [2020-02-10 20:02:33,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:33,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:33,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:33,877 INFO L87 Difference]: Start difference. First operand 3130 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:02:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:34,107 INFO L93 Difference]: Finished difference Result 6036 states and 26873 transitions. [2020-02-10 20:02:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:34,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:34,121 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:02:34,121 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 20:02:34,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 20:02:34,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 20:02:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 20:02:34,322 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 20:02:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:34,323 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 20:02:34,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 20:02:34,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:34,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:34,328 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash -500281666, now seen corresponding path program 201 times [2020-02-10 20:02:34,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:34,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956142308] [2020-02-10 20:02:34,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:34,860 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:34,989 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:35,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956142308] [2020-02-10 20:02:35,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:35,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:35,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701626751] [2020-02-10 20:02:35,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:35,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:35,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:35,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:35,041 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:02:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:35,312 INFO L93 Difference]: Finished difference Result 6049 states and 26901 transitions. [2020-02-10 20:02:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:35,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:35,328 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:02:35,328 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:02:35,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:02:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3134. [2020-02-10 20:02:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:02:35,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15605 transitions. [2020-02-10 20:02:35,541 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15605 transitions. Word has length 31 [2020-02-10 20:02:35,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:35,542 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15605 transitions. [2020-02-10 20:02:35,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15605 transitions. [2020-02-10 20:02:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:35,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:35,548 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:35,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:35,548 INFO L82 PathProgramCache]: Analyzing trace with hash -430171630, now seen corresponding path program 202 times [2020-02-10 20:02:35,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:35,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646009017] [2020-02-10 20:02:35,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:36,097 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:36,227 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:36,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646009017] [2020-02-10 20:02:36,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:36,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:36,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073762975] [2020-02-10 20:02:36,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:36,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:36,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:36,237 INFO L87 Difference]: Start difference. First operand 3134 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:02:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:36,440 INFO L93 Difference]: Finished difference Result 6052 states and 26898 transitions. [2020-02-10 20:02:36,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:36,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:36,455 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:02:36,456 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 20:02:36,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 20:02:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3125. [2020-02-10 20:02:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 20:02:36,662 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 20:02:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:36,662 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 20:02:36,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:36,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 20:02:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:36,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:36,667 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1134923010, now seen corresponding path program 203 times [2020-02-10 20:02:36,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:36,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44869133] [2020-02-10 20:02:36,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:37,216 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:02:37,344 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:37,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:02:37,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44869133] [2020-02-10 20:02:37,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:37,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:37,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948122404] [2020-02-10 20:02:37,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:37,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:37,355 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:02:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:37,586 INFO L93 Difference]: Finished difference Result 6040 states and 26874 transitions. [2020-02-10 20:02:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:37,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:37,602 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:02:37,602 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:02:37,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:02:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3131. [2020-02-10 20:02:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:02:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15593 transitions. [2020-02-10 20:02:37,801 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15593 transitions. Word has length 31 [2020-02-10 20:02:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:37,801 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15593 transitions. [2020-02-10 20:02:37,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15593 transitions. [2020-02-10 20:02:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:37,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:37,806 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -642327248, now seen corresponding path program 204 times [2020-02-10 20:02:37,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:37,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489881968] [2020-02-10 20:02:37,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:38,353 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:38,486 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:38,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489881968] [2020-02-10 20:02:38,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:38,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:38,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589730286] [2020-02-10 20:02:38,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:38,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:38,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:38,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:38,501 INFO L87 Difference]: Start difference. First operand 3131 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:02:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:38,729 INFO L93 Difference]: Finished difference Result 6046 states and 26880 transitions. [2020-02-10 20:02:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:38,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:38,745 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:02:38,745 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:02:38,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:02:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3119. [2020-02-10 20:02:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:02:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:02:38,952 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:02:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:38,953 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:02:38,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:02:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:38,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:38,958 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:38,958 INFO L82 PathProgramCache]: Analyzing trace with hash -670054096, now seen corresponding path program 205 times [2020-02-10 20:02:38,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:38,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573575267] [2020-02-10 20:02:38,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:39,505 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:39,639 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573575267] [2020-02-10 20:02:39,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:39,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:39,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702326745] [2020-02-10 20:02:39,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:39,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:39,648 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:02:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:39,935 INFO L93 Difference]: Finished difference Result 6051 states and 26912 transitions. [2020-02-10 20:02:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:39,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:39,951 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:02:39,951 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:02:39,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:02:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 20:02:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:02:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15608 transitions. [2020-02-10 20:02:40,157 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15608 transitions. Word has length 31 [2020-02-10 20:02:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:40,157 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15608 transitions. [2020-02-10 20:02:40,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15608 transitions. [2020-02-10 20:02:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:40,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:40,162 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:40,163 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash 667513118, now seen corresponding path program 206 times [2020-02-10 20:02:40,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:40,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751419973] [2020-02-10 20:02:40,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:40,705 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:40,830 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:40,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:40,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751419973] [2020-02-10 20:02:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:40,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883436182] [2020-02-10 20:02:40,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:40,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:40,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:40,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:40,840 INFO L87 Difference]: Start difference. First operand 3134 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:02:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:41,075 INFO L93 Difference]: Finished difference Result 6050 states and 26903 transitions. [2020-02-10 20:02:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:41,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:41,091 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:02:41,091 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:02:41,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:02:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 20:02:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:02:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 20:02:41,297 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 20:02:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:41,297 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 20:02:41,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 20:02:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:41,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:41,303 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1306520950, now seen corresponding path program 207 times [2020-02-10 20:02:41,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:41,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019072497] [2020-02-10 20:02:41,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:41,857 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:41,988 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:41,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019072497] [2020-02-10 20:02:41,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:41,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:41,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585183307] [2020-02-10 20:02:41,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:41,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:41,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:41,999 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:02:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:42,250 INFO L93 Difference]: Finished difference Result 6057 states and 26917 transitions. [2020-02-10 20:02:42,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:42,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:42,265 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:02:42,265 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:02:42,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:02:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3136. [2020-02-10 20:02:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:02:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15605 transitions. [2020-02-10 20:02:42,508 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15605 transitions. Word has length 31 [2020-02-10 20:02:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:42,508 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15605 transitions. [2020-02-10 20:02:42,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15605 transitions. [2020-02-10 20:02:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:42,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:42,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:42,514 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:42,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:42,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1236410914, now seen corresponding path program 208 times [2020-02-10 20:02:42,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:42,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869930956] [2020-02-10 20:02:42,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:43,078 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:02:43,208 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:02:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:43,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869930956] [2020-02-10 20:02:43,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:43,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:43,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555328450] [2020-02-10 20:02:43,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:43,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:43,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:43,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:43,217 INFO L87 Difference]: Start difference. First operand 3136 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:02:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:43,426 INFO L93 Difference]: Finished difference Result 6060 states and 26914 transitions. [2020-02-10 20:02:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:43,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:43,441 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:02:43,441 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 20:02:43,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 20:02:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 20:02:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:02:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15580 transitions. [2020-02-10 20:02:43,648 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15580 transitions. Word has length 31 [2020-02-10 20:02:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:43,648 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15580 transitions. [2020-02-10 20:02:43,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:43,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15580 transitions. [2020-02-10 20:02:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:43,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:43,653 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1454043062, now seen corresponding path program 209 times [2020-02-10 20:02:43,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:43,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460546753] [2020-02-10 20:02:43,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:44,193 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:44,320 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:44,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460546753] [2020-02-10 20:02:44,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:44,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:44,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940092472] [2020-02-10 20:02:44,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:44,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:44,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:44,331 INFO L87 Difference]: Start difference. First operand 3127 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:02:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:44,556 INFO L93 Difference]: Finished difference Result 6054 states and 26902 transitions. [2020-02-10 20:02:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:44,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:44,570 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:02:44,571 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:02:44,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:44,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:02:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 20:02:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:02:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15595 transitions. [2020-02-10 20:02:44,779 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15595 transitions. Word has length 31 [2020-02-10 20:02:44,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:44,779 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15595 transitions. [2020-02-10 20:02:44,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15595 transitions. [2020-02-10 20:02:44,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:44,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:44,785 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:44,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1573467056, now seen corresponding path program 210 times [2020-02-10 20:02:44,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:44,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875951361] [2020-02-10 20:02:44,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:45,338 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:45,474 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:45,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:02:45,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875951361] [2020-02-10 20:02:45,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:45,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:45,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582428734] [2020-02-10 20:02:45,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:45,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:45,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:45,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:45,485 INFO L87 Difference]: Start difference. First operand 3135 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:02:45,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:45,682 INFO L93 Difference]: Finished difference Result 6058 states and 26902 transitions. [2020-02-10 20:02:45,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:45,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:45,697 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:02:45,697 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:02:45,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:02:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3119. [2020-02-10 20:02:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:02:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15559 transitions. [2020-02-10 20:02:45,896 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15559 transitions. Word has length 31 [2020-02-10 20:02:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:45,896 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15559 transitions. [2020-02-10 20:02:45,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15559 transitions. [2020-02-10 20:02:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:45,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:45,902 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:45,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:45,902 INFO L82 PathProgramCache]: Analyzing trace with hash 708414994, now seen corresponding path program 211 times [2020-02-10 20:02:45,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:45,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190613915] [2020-02-10 20:02:45,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:46,429 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:46,563 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:46,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:02:46,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190613915] [2020-02-10 20:02:46,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:46,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:46,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207685165] [2020-02-10 20:02:46,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:46,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:46,573 INFO L87 Difference]: Start difference. First operand 3119 states and 15559 transitions. Second operand 12 states. [2020-02-10 20:02:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:46,840 INFO L93 Difference]: Finished difference Result 6033 states and 26859 transitions. [2020-02-10 20:02:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:46,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:46,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:46,856 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:02:46,856 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:02:46,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:02:47,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 20:02:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:02:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15590 transitions. [2020-02-10 20:02:47,066 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15590 transitions. Word has length 31 [2020-02-10 20:02:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:47,066 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15590 transitions. [2020-02-10 20:02:47,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15590 transitions. [2020-02-10 20:02:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:47,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:47,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:47,071 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:47,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:47,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1826499362, now seen corresponding path program 212 times [2020-02-10 20:02:47,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:47,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389559975] [2020-02-10 20:02:47,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:47,602 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:47,733 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:47,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:47,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389559975] [2020-02-10 20:02:47,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:47,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:47,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139859965] [2020-02-10 20:02:47,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:47,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:47,743 INFO L87 Difference]: Start difference. First operand 3130 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:02:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:47,997 INFO L93 Difference]: Finished difference Result 6035 states and 26858 transitions. [2020-02-10 20:02:47,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:47,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:47,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:48,011 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:02:48,011 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:02:48,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:02:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 20:02:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:02:48,220 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:02:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:48,220 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:02:48,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:02:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:48,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:48,226 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash 71948140, now seen corresponding path program 213 times [2020-02-10 20:02:48,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:48,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569539865] [2020-02-10 20:02:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:48,757 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:48,891 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:48,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569539865] [2020-02-10 20:02:48,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:48,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:48,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904827053] [2020-02-10 20:02:48,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:48,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:48,900 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:02:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:49,196 INFO L93 Difference]: Finished difference Result 6038 states and 26863 transitions. [2020-02-10 20:02:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:49,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:49,211 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:02:49,211 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:02:49,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:02:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 20:02:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:02:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15587 transitions. [2020-02-10 20:02:49,421 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15587 transitions. Word has length 31 [2020-02-10 20:02:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:49,421 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15587 transitions. [2020-02-10 20:02:49,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15587 transitions. [2020-02-10 20:02:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:49,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:49,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:49,427 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash 564543902, now seen corresponding path program 214 times [2020-02-10 20:02:49,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:49,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923907277] [2020-02-10 20:02:49,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:49,993 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:50,127 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:50,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:02:50,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923907277] [2020-02-10 20:02:50,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:50,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:50,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379146924] [2020-02-10 20:02:50,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:50,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:50,137 INFO L87 Difference]: Start difference. First operand 3131 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:02:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:50,336 INFO L93 Difference]: Finished difference Result 6044 states and 26869 transitions. [2020-02-10 20:02:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:50,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:50,351 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:02:50,351 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:02:50,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:02:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 20:02:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15570 transitions. [2020-02-10 20:02:50,552 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15570 transitions. Word has length 31 [2020-02-10 20:02:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:50,552 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15570 transitions. [2020-02-10 20:02:50,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15570 transitions. [2020-02-10 20:02:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:50,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:50,558 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 559067372, now seen corresponding path program 215 times [2020-02-10 20:02:50,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:50,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576196042] [2020-02-10 20:02:50,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:51,089 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:51,216 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:51,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:02:51,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576196042] [2020-02-10 20:02:51,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:51,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:51,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925691142] [2020-02-10 20:02:51,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:51,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:51,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:51,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:51,227 INFO L87 Difference]: Start difference. First operand 3125 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:02:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:51,483 INFO L93 Difference]: Finished difference Result 6044 states and 26871 transitions. [2020-02-10 20:02:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:51,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:51,498 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:02:51,498 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:02:51,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:02:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3133. [2020-02-10 20:02:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:02:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 20:02:51,701 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 20:02:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:51,701 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 20:02:51,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 20:02:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:51,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:51,706 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash -708389806, now seen corresponding path program 216 times [2020-02-10 20:02:51,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:51,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361769582] [2020-02-10 20:02:51,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:52,241 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:02:52,376 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:52,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:02:52,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361769582] [2020-02-10 20:02:52,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:52,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:52,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070551552] [2020-02-10 20:02:52,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:52,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:52,386 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:02:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:52,636 INFO L93 Difference]: Finished difference Result 6048 states and 26871 transitions. [2020-02-10 20:02:52,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:52,637 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:52,652 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:02:52,652 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:02:52,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:02:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3113. [2020-02-10 20:02:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:02:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15542 transitions. [2020-02-10 20:02:52,858 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15542 transitions. Word has length 31 [2020-02-10 20:02:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:52,858 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15542 transitions. [2020-02-10 20:02:52,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15542 transitions. [2020-02-10 20:02:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:52,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:52,863 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:52,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1409124346, now seen corresponding path program 217 times [2020-02-10 20:02:52,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:52,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206394106] [2020-02-10 20:02:52,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:53,376 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:53,505 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:53,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:02:53,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206394106] [2020-02-10 20:02:53,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:53,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:53,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448132814] [2020-02-10 20:02:53,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:53,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:53,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:53,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:53,515 INFO L87 Difference]: Start difference. First operand 3113 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:02:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:53,805 INFO L93 Difference]: Finished difference Result 6036 states and 26877 transitions. [2020-02-10 20:02:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:53,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:53,821 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:02:53,821 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:02:53,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:02:54,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 20:02:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:02:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15601 transitions. [2020-02-10 20:02:54,023 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15601 transitions. Word has length 31 [2020-02-10 20:02:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:54,023 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15601 transitions. [2020-02-10 20:02:54,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15601 transitions. [2020-02-10 20:02:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:54,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:54,029 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:54,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2040871498, now seen corresponding path program 218 times [2020-02-10 20:02:54,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:54,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650916580] [2020-02-10 20:02:54,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:54,547 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:54,678 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:54,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650916580] [2020-02-10 20:02:54,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:54,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:54,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317336162] [2020-02-10 20:02:54,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:54,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:54,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:54,689 INFO L87 Difference]: Start difference. First operand 3130 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:02:54,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:54,958 INFO L93 Difference]: Finished difference Result 6040 states and 26880 transitions. [2020-02-10 20:02:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:54,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:54,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:54,973 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:02:54,973 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 20:02:54,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 20:02:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 20:02:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15587 transitions. [2020-02-10 20:02:55,179 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15587 transitions. Word has length 31 [2020-02-10 20:02:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:55,179 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15587 transitions. [2020-02-10 20:02:55,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15587 transitions. [2020-02-10 20:02:55,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:55,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:55,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:55,185 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2037220478, now seen corresponding path program 219 times [2020-02-10 20:02:55,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:55,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571840796] [2020-02-10 20:02:55,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:55,712 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:02:55,843 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:55,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:02:55,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571840796] [2020-02-10 20:02:55,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:55,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:55,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711860725] [2020-02-10 20:02:55,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:55,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:55,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:55,854 INFO L87 Difference]: Start difference. First operand 3125 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:02:56,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:56,108 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 20:02:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:56,108 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:56,124 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:02:56,124 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:02:56,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:02:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 20:02:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:02:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15596 transitions. [2020-02-10 20:02:56,326 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15596 transitions. Word has length 31 [2020-02-10 20:02:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:56,326 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15596 transitions. [2020-02-10 20:02:56,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15596 transitions. [2020-02-10 20:02:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:56,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:56,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:56,331 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -497693878, now seen corresponding path program 220 times [2020-02-10 20:02:56,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:56,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772226185] [2020-02-10 20:02:56,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:56,863 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:02:56,998 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:57,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:02:57,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772226185] [2020-02-10 20:02:57,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:57,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:57,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56985631] [2020-02-10 20:02:57,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:57,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:57,007 INFO L87 Difference]: Start difference. First operand 3130 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:02:57,255 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2020-02-10 20:02:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:57,276 INFO L93 Difference]: Finished difference Result 6036 states and 26867 transitions. [2020-02-10 20:02:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:57,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:57,292 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:02:57,292 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:02:57,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:02:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 20:02:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:02:57,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 20:02:57,493 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 20:02:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:57,493 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 20:02:57,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 20:02:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:57,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:57,499 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:57,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 767937790, now seen corresponding path program 221 times [2020-02-10 20:02:57,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:57,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736761968] [2020-02-10 20:02:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:58,020 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:02:58,155 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:58,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:02:58,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736761968] [2020-02-10 20:02:58,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:58,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:58,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325684317] [2020-02-10 20:02:58,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:58,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:58,165 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:02:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:58,419 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 20:02:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:58,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:58,434 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:02:58,434 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:02:58,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:02:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3132. [2020-02-10 20:02:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:02:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15595 transitions. [2020-02-10 20:02:58,635 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15595 transitions. Word has length 31 [2020-02-10 20:02:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:58,635 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15595 transitions. [2020-02-10 20:02:58,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15595 transitions. [2020-02-10 20:02:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:58,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:58,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:58,640 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash -922005114, now seen corresponding path program 222 times [2020-02-10 20:02:58,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:58,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336081330] [2020-02-10 20:02:58,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:02:59,162 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:02:59,290 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:02:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:02:59,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336081330] [2020-02-10 20:02:59,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:02:59,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:02:59,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576770538] [2020-02-10 20:02:59,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:02:59,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:02:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:02:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:02:59,300 INFO L87 Difference]: Start difference. First operand 3132 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:02:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:02:59,536 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 20:02:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:02:59,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:02:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:02:59,552 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:02:59,552 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:02:59,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:02:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:02:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3120. [2020-02-10 20:02:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:02:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 20:02:59,753 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 20:02:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:02:59,753 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 20:02:59,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:02:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 20:02:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:02:59,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:02:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:02:59,759 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:02:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:02:59,759 INFO L82 PathProgramCache]: Analyzing trace with hash 335239660, now seen corresponding path program 223 times [2020-02-10 20:02:59,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:02:59,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541873679] [2020-02-10 20:02:59,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:02:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:00,270 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:00,398 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:00,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541873679] [2020-02-10 20:03:00,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:00,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:00,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518464400] [2020-02-10 20:03:00,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:00,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:00,409 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:03:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:00,704 INFO L93 Difference]: Finished difference Result 6047 states and 26895 transitions. [2020-02-10 20:03:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:00,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:00,718 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 20:03:00,718 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:03:00,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:03:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3132. [2020-02-10 20:03:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:03:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 20:03:00,923 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 20:03:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:00,923 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 20:03:00,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 20:03:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:00,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:00,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:00,928 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:00,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:00,929 INFO L82 PathProgramCache]: Analyzing trace with hash -509731792, now seen corresponding path program 224 times [2020-02-10 20:03:00,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:00,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864731656] [2020-02-10 20:03:00,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:01,463 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:01,597 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:01,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:03:01,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864731656] [2020-02-10 20:03:01,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:01,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:01,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791708218] [2020-02-10 20:03:01,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:01,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:01,607 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:03:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:01,963 INFO L93 Difference]: Finished difference Result 6051 states and 26898 transitions. [2020-02-10 20:03:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:01,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:01,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:01,979 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:03:01,979 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:03:01,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:03:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3127. [2020-02-10 20:03:02,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:03:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:03:02,185 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:03:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:02,185 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:03:02,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:03:02,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:02,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:02,191 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:02,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1149849666, now seen corresponding path program 225 times [2020-02-10 20:03:02,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:02,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992779996] [2020-02-10 20:03:02,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:02,730 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:02,861 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:02,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:03:02,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992779996] [2020-02-10 20:03:02,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:02,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:02,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877666521] [2020-02-10 20:03:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:02,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:02,871 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:03:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:03,223 INFO L93 Difference]: Finished difference Result 6050 states and 26895 transitions. [2020-02-10 20:03:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:03,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:03,238 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:03:03,238 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:03:03,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:03:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 20:03:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:03:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 20:03:03,439 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 20:03:03,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:03,439 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 20:03:03,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 20:03:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:03,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:03,445 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:03,445 INFO L82 PathProgramCache]: Analyzing trace with hash -657253904, now seen corresponding path program 226 times [2020-02-10 20:03:03,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:03,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428556252] [2020-02-10 20:03:03,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:03,973 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:04,101 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:04,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428556252] [2020-02-10 20:03:04,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:04,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:04,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58423986] [2020-02-10 20:03:04,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:04,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:04,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:04,111 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:03:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:04,436 INFO L93 Difference]: Finished difference Result 6056 states and 26901 transitions. [2020-02-10 20:03:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:04,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:04,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:04,451 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:03:04,451 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:03:04,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:03:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 20:03:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:03:04,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:03:04,719 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:03:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:04,719 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:03:04,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:04,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:03:04,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:04,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:04,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:04,725 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:04,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:04,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1875834942, now seen corresponding path program 227 times [2020-02-10 20:03:04,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:04,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79506548] [2020-02-10 20:03:04,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:05,276 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:05,403 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:05,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79506548] [2020-02-10 20:03:05,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:05,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:05,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415131428] [2020-02-10 20:03:05,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:05,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:05,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:05,413 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:03:05,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:05,773 INFO L93 Difference]: Finished difference Result 6063 states and 26918 transitions. [2020-02-10 20:03:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:05,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:05,789 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:03:05,789 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:03:05,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:03:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3138. [2020-02-10 20:03:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:03:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15601 transitions. [2020-02-10 20:03:05,996 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15601 transitions. Word has length 31 [2020-02-10 20:03:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:05,996 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15601 transitions. [2020-02-10 20:03:05,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15601 transitions. [2020-02-10 20:03:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:06,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:06,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:06,002 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1081565140, now seen corresponding path program 228 times [2020-02-10 20:03:06,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:06,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399547145] [2020-02-10 20:03:06,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:06,573 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:06,706 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:06,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:03:06,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399547145] [2020-02-10 20:03:06,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:06,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:06,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800789434] [2020-02-10 20:03:06,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:06,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:06,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:06,716 INFO L87 Difference]: Start difference. First operand 3138 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:03:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:07,038 INFO L93 Difference]: Finished difference Result 6065 states and 26912 transitions. [2020-02-10 20:03:07,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:07,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:07,053 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:03:07,053 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:03:07,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:03:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3120. [2020-02-10 20:03:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:03:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15561 transitions. [2020-02-10 20:03:07,254 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15561 transitions. Word has length 31 [2020-02-10 20:03:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:07,254 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15561 transitions. [2020-02-10 20:03:07,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15561 transitions. [2020-02-10 20:03:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:07,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:07,259 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:07,259 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1050875668, now seen corresponding path program 229 times [2020-02-10 20:03:07,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:07,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489744133] [2020-02-10 20:03:07,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:07,792 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:07,924 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:07,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489744133] [2020-02-10 20:03:07,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:07,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:07,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433112827] [2020-02-10 20:03:07,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:07,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:07,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:07,934 INFO L87 Difference]: Start difference. First operand 3120 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:03:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:08,152 INFO L93 Difference]: Finished difference Result 6039 states and 26871 transitions. [2020-02-10 20:03:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:08,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:08,168 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:03:08,168 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:03:08,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:03:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3131. [2020-02-10 20:03:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:03:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15592 transitions. [2020-02-10 20:03:08,373 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15592 transitions. Word has length 31 [2020-02-10 20:03:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:08,373 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15592 transitions. [2020-02-10 20:03:08,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15592 transitions. [2020-02-10 20:03:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:08,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:08,379 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 709177272, now seen corresponding path program 230 times [2020-02-10 20:03:08,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:08,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859392882] [2020-02-10 20:03:08,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:08,918 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:03:09,053 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:09,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:03:09,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859392882] [2020-02-10 20:03:09,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:09,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:09,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869492683] [2020-02-10 20:03:09,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:09,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:09,063 INFO L87 Difference]: Start difference. First operand 3131 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:03:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:09,281 INFO L93 Difference]: Finished difference Result 6041 states and 26870 transitions. [2020-02-10 20:03:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:09,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:09,295 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:03:09,295 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:03:09,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:03:09,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3126. [2020-02-10 20:03:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:03:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15578 transitions. [2020-02-10 20:03:09,496 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15578 transitions. Word has length 31 [2020-02-10 20:03:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:09,496 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15578 transitions. [2020-02-10 20:03:09,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15578 transitions. [2020-02-10 20:03:09,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:09,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:09,502 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:09,502 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:09,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:09,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1687342522, now seen corresponding path program 231 times [2020-02-10 20:03:09,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:09,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055151711] [2020-02-10 20:03:09,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:10,034 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:10,169 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:10,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055151711] [2020-02-10 20:03:10,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:10,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:10,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764714177] [2020-02-10 20:03:10,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:10,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:10,179 INFO L87 Difference]: Start difference. First operand 3126 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:03:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:10,398 INFO L93 Difference]: Finished difference Result 6044 states and 26875 transitions. [2020-02-10 20:03:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:10,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:10,414 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:03:10,414 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:03:10,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:03:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3132. [2020-02-10 20:03:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:03:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15589 transitions. [2020-02-10 20:03:10,616 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15589 transitions. Word has length 31 [2020-02-10 20:03:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:10,616 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15589 transitions. [2020-02-10 20:03:10,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15589 transitions. [2020-02-10 20:03:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:10,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:10,621 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:10,621 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:10,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1194746760, now seen corresponding path program 232 times [2020-02-10 20:03:10,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:10,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122470994] [2020-02-10 20:03:10,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:11,152 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:11,279 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:11,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:03:11,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122470994] [2020-02-10 20:03:11,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:11,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:11,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846420291] [2020-02-10 20:03:11,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:11,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:11,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:11,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:11,289 INFO L87 Difference]: Start difference. First operand 3132 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:03:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:11,468 INFO L93 Difference]: Finished difference Result 6050 states and 26881 transitions. [2020-02-10 20:03:11,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:11,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:11,482 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:03:11,483 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:03:11,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:03:11,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 20:03:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:03:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:03:11,683 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:03:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:11,683 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:03:11,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:03:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:11,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:11,688 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1200223290, now seen corresponding path program 233 times [2020-02-10 20:03:11,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:11,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091469910] [2020-02-10 20:03:11,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:12,396 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:12,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091469910] [2020-02-10 20:03:12,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:12,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:12,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162291412] [2020-02-10 20:03:12,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:12,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:12,405 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:03:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:12,622 INFO L93 Difference]: Finished difference Result 6050 states and 26883 transitions. [2020-02-10 20:03:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:12,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:12,637 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:03:12,637 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:03:12,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:03:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 20:03:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:03:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15587 transitions. [2020-02-10 20:03:12,843 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15587 transitions. Word has length 31 [2020-02-10 20:03:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:12,843 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15587 transitions. [2020-02-10 20:03:12,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15587 transitions. [2020-02-10 20:03:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:12,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:12,849 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1827286828, now seen corresponding path program 234 times [2020-02-10 20:03:12,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:12,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859702370] [2020-02-10 20:03:12,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:13,398 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:13,529 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:13,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859702370] [2020-02-10 20:03:13,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:13,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:13,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951221924] [2020-02-10 20:03:13,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:13,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:13,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:13,539 INFO L87 Difference]: Start difference. First operand 3134 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:03:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:13,748 INFO L93 Difference]: Finished difference Result 6054 states and 26883 transitions. [2020-02-10 20:03:13,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:13,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:13,762 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:03:13,762 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:03:13,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:03:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3120. [2020-02-10 20:03:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:03:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15555 transitions. [2020-02-10 20:03:13,964 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15555 transitions. Word has length 31 [2020-02-10 20:03:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:13,964 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15555 transitions. [2020-02-10 20:03:13,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15555 transitions. [2020-02-10 20:03:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:13,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:13,969 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:13,969 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1706062512, now seen corresponding path program 235 times [2020-02-10 20:03:13,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:13,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23017894] [2020-02-10 20:03:13,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:14,502 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:14,633 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:14,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:03:14,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23017894] [2020-02-10 20:03:14,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:14,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:14,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038907625] [2020-02-10 20:03:14,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:14,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:14,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:14,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:14,644 INFO L87 Difference]: Start difference. First operand 3120 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:03:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:14,868 INFO L93 Difference]: Finished difference Result 6063 states and 26924 transitions. [2020-02-10 20:03:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:14,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:14,885 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:03:14,885 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:03:14,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:03:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3136. [2020-02-10 20:03:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:03:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15600 transitions. [2020-02-10 20:03:15,093 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15600 transitions. Word has length 31 [2020-02-10 20:03:15,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:15,093 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15600 transitions. [2020-02-10 20:03:15,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15600 transitions. [2020-02-10 20:03:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:15,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:15,099 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:15,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:15,099 INFO L82 PathProgramCache]: Analyzing trace with hash 16119608, now seen corresponding path program 236 times [2020-02-10 20:03:15,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:15,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089928876] [2020-02-10 20:03:15,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:15,631 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:03:15,760 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:15,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:03:15,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089928876] [2020-02-10 20:03:15,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:15,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:15,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36445263] [2020-02-10 20:03:15,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:15,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:15,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:15,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:15,770 INFO L87 Difference]: Start difference. First operand 3136 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:03:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:16,009 INFO L93 Difference]: Finished difference Result 6061 states and 26913 transitions. [2020-02-10 20:03:16,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:16,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:16,024 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:03:16,024 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:03:16,024 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:03:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3129. [2020-02-10 20:03:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:03:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15580 transitions. [2020-02-10 20:03:16,230 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15580 transitions. Word has length 31 [2020-02-10 20:03:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:16,230 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15580 transitions. [2020-02-10 20:03:16,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15580 transitions. [2020-02-10 20:03:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:16,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:16,235 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:16,235 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1069595658, now seen corresponding path program 237 times [2020-02-10 20:03:16,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879358976] [2020-02-10 20:03:16,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:16,785 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:16,916 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:03:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:16,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879358976] [2020-02-10 20:03:16,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:16,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:16,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473129353] [2020-02-10 20:03:16,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:16,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:16,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:16,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:16,925 INFO L87 Difference]: Start difference. First operand 3129 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:03:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:17,204 INFO L93 Difference]: Finished difference Result 6071 states and 26933 transitions. [2020-02-10 20:03:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:17,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:17,219 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:03:17,219 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:03:17,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:03:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 20:03:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:03:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15600 transitions. [2020-02-10 20:03:17,426 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15600 transitions. Word has length 31 [2020-02-10 20:03:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:17,426 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15600 transitions. [2020-02-10 20:03:17,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15600 transitions. [2020-02-10 20:03:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:17,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:17,431 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:17,431 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:17,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:17,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1887804424, now seen corresponding path program 238 times [2020-02-10 20:03:17,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:17,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465125929] [2020-02-10 20:03:17,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:17,986 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:18,117 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:18,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:03:18,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465125929] [2020-02-10 20:03:18,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:18,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:18,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458162215] [2020-02-10 20:03:18,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:18,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:18,128 INFO L87 Difference]: Start difference. First operand 3140 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:03:18,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:18,326 INFO L93 Difference]: Finished difference Result 6073 states and 26927 transitions. [2020-02-10 20:03:18,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:18,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:18,340 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:03:18,340 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:03:18,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:03:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 20:03:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:03:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15571 transitions. [2020-02-10 20:03:18,547 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15571 transitions. Word has length 31 [2020-02-10 20:03:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:18,547 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15571 transitions. [2020-02-10 20:03:18,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15571 transitions. [2020-02-10 20:03:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:18,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:18,552 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1468969718, now seen corresponding path program 239 times [2020-02-10 20:03:18,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:18,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211673307] [2020-02-10 20:03:18,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:19,109 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:03:19,235 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:19,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:03:19,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211673307] [2020-02-10 20:03:19,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:19,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:19,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322592133] [2020-02-10 20:03:19,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:19,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:19,244 INFO L87 Difference]: Start difference. First operand 3129 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:03:19,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:19,472 INFO L93 Difference]: Finished difference Result 6064 states and 26909 transitions. [2020-02-10 20:03:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:19,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:19,488 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:03:19,488 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:03:19,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:03:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3137. [2020-02-10 20:03:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:03:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 20:03:19,689 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 20:03:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:19,689 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 20:03:19,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 20:03:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:19,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:19,694 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:19,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1558540400, now seen corresponding path program 240 times [2020-02-10 20:03:19,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:19,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211258559] [2020-02-10 20:03:19,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:20,279 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:03:20,407 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:03:20,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:03:20,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211258559] [2020-02-10 20:03:20,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:20,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:20,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778660853] [2020-02-10 20:03:20,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:20,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:20,417 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:03:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:20,605 INFO L93 Difference]: Finished difference Result 6068 states and 26909 transitions. [2020-02-10 20:03:20,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:20,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:20,621 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:03:20,621 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:03:20,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:20,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:03:20,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3104. [2020-02-10 20:03:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:03:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15518 transitions. [2020-02-10 20:03:20,826 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15518 transitions. Word has length 31 [2020-02-10 20:03:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:20,827 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15518 transitions. [2020-02-10 20:03:20,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15518 transitions. [2020-02-10 20:03:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:20,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:20,832 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash 316275074, now seen corresponding path program 241 times [2020-02-10 20:03:20,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:20,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830843394] [2020-02-10 20:03:20,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:21,497 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:21,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:03:21,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830843394] [2020-02-10 20:03:21,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:21,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:21,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718334333] [2020-02-10 20:03:21,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:21,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:21,508 INFO L87 Difference]: Start difference. First operand 3104 states and 15518 transitions. Second operand 12 states. [2020-02-10 20:03:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:21,733 INFO L93 Difference]: Finished difference Result 5976 states and 26732 transitions. [2020-02-10 20:03:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:21,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:21,749 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:03:21,749 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:03:21,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:03:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 20:03:21,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15599 transitions. [2020-02-10 20:03:21,956 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15599 transitions. Word has length 31 [2020-02-10 20:03:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:21,956 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15599 transitions. [2020-02-10 20:03:21,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15599 transitions. [2020-02-10 20:03:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:21,962 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:21,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:21,962 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash -106210652, now seen corresponding path program 242 times [2020-02-10 20:03:21,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:21,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470632103] [2020-02-10 20:03:21,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:22,492 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:03:22,619 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:22,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:03:22,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470632103] [2020-02-10 20:03:22,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:22,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:22,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255725572] [2020-02-10 20:03:22,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:22,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:22,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:22,628 INFO L87 Difference]: Start difference. First operand 3124 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:03:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:22,855 INFO L93 Difference]: Finished difference Result 5973 states and 26721 transitions. [2020-02-10 20:03:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:22,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:22,869 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:03:22,869 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:03:22,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:03:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3119. [2020-02-10 20:03:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15585 transitions. [2020-02-10 20:03:23,074 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15585 transitions. Word has length 31 [2020-02-10 20:03:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:23,075 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15585 transitions. [2020-02-10 20:03:23,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15585 transitions. [2020-02-10 20:03:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:23,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:23,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:23,080 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash -108036162, now seen corresponding path program 243 times [2020-02-10 20:03:23,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:23,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657772073] [2020-02-10 20:03:23,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:23,613 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:03:23,741 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:23,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657772073] [2020-02-10 20:03:23,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:23,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:23,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176518893] [2020-02-10 20:03:23,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:23,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:23,751 INFO L87 Difference]: Start difference. First operand 3119 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:03:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:23,980 INFO L93 Difference]: Finished difference Result 5983 states and 26744 transitions. [2020-02-10 20:03:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:23,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:23,996 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:03:23,996 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:03:23,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:03:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3127. [2020-02-10 20:03:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:03:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15600 transitions. [2020-02-10 20:03:24,201 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15600 transitions. Word has length 31 [2020-02-10 20:03:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:24,201 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15600 transitions. [2020-02-10 20:03:24,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15600 transitions. [2020-02-10 20:03:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:24,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:24,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:24,207 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1375493340, now seen corresponding path program 244 times [2020-02-10 20:03:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:24,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937833763] [2020-02-10 20:03:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:24,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:24,880 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03:24,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:03:24,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937833763] [2020-02-10 20:03:24,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:24,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:24,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707826720] [2020-02-10 20:03:24,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:24,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:24,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:24,891 INFO L87 Difference]: Start difference. First operand 3127 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:03:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:25,157 INFO L93 Difference]: Finished difference Result 5984 states and 26738 transitions. [2020-02-10 20:03:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:25,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:25,172 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:03:25,172 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:03:25,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:03:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 20:03:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:03:25,373 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:03:25,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:25,373 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:03:25,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:03:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:25,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:25,379 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:25,379 INFO L82 PathProgramCache]: Analyzing trace with hash -742677506, now seen corresponding path program 245 times [2020-02-10 20:03:25,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:25,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275674843] [2020-02-10 20:03:25,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:25,917 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:26,051 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03:26,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:03:26,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275674843] [2020-02-10 20:03:26,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:26,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:26,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215110802] [2020-02-10 20:03:26,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:26,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:26,061 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:03:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:26,354 INFO L93 Difference]: Finished difference Result 5974 states and 26718 transitions. [2020-02-10 20:03:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:26,355 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:26,369 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:03:26,369 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:03:26,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:26,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:03:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:03:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:03:26,570 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:03:26,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:26,571 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:03:26,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:03:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:26,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:26,576 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1587648958, now seen corresponding path program 246 times [2020-02-10 20:03:26,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:26,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897492776] [2020-02-10 20:03:26,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:27,112 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:03:27,241 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:27,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897492776] [2020-02-10 20:03:27,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:27,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:27,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170415012] [2020-02-10 20:03:27,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:27,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:27,252 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:03:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:27,534 INFO L93 Difference]: Finished difference Result 5978 states and 26721 transitions. [2020-02-10 20:03:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:27,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:27,550 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:03:27,550 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:03:27,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:03:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3114. [2020-02-10 20:03:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:03:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15566 transitions. [2020-02-10 20:03:27,750 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15566 transitions. Word has length 31 [2020-02-10 20:03:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:27,750 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15566 transitions. [2020-02-10 20:03:27,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15566 transitions. [2020-02-10 20:03:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:27,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:27,757 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:27,757 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:27,758 INFO L82 PathProgramCache]: Analyzing trace with hash 47528646, now seen corresponding path program 247 times [2020-02-10 20:03:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506994462] [2020-02-10 20:03:27,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:28,297 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:03:28,427 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:28,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:03:28,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506994462] [2020-02-10 20:03:28,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:28,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:28,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470014402] [2020-02-10 20:03:28,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:28,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:28,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:28,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:28,437 INFO L87 Difference]: Start difference. First operand 3114 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:03:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:28,684 INFO L93 Difference]: Finished difference Result 5971 states and 26715 transitions. [2020-02-10 20:03:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:28,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:28,701 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:03:28,701 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:03:28,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:03:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:03:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 20:03:28,909 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 20:03:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:28,909 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 20:03:28,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 20:03:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:28,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:28,914 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:28,915 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash -374957080, now seen corresponding path program 248 times [2020-02-10 20:03:28,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:28,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773731541] [2020-02-10 20:03:28,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:29,435 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:03:29,564 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:29,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:03:29,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773731541] [2020-02-10 20:03:29,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:29,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:29,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030015689] [2020-02-10 20:03:29,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:29,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:29,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:29,574 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:03:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:29,889 INFO L93 Difference]: Finished difference Result 5968 states and 26704 transitions. [2020-02-10 20:03:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:29,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:29,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:29,904 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:03:29,904 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:03:29,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:03:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:03:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:03:30,110 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:03:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:30,110 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:03:30,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:03:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:30,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:30,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:30,116 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:30,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:30,116 INFO L82 PathProgramCache]: Analyzing trace with hash -801093826, now seen corresponding path program 249 times [2020-02-10 20:03:30,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:30,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554239522] [2020-02-10 20:03:30,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:30,653 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:30,787 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:30,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554239522] [2020-02-10 20:03:30,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:30,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:30,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748648494] [2020-02-10 20:03:30,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:30,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:30,797 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:03:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:31,038 INFO L93 Difference]: Finished difference Result 5973 states and 26715 transitions. [2020-02-10 20:03:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:31,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:31,053 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:03:31,053 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:03:31,053 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:03:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 20:03:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:03:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:03:31,260 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:03:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:31,260 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:03:31,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:03:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:31,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:31,266 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1381444840, now seen corresponding path program 250 times [2020-02-10 20:03:31,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:31,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668307037] [2020-02-10 20:03:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:31,788 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:31,918 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:31,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668307037] [2020-02-10 20:03:31,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:31,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:31,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592912936] [2020-02-10 20:03:31,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:31,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:31,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:31,928 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:03:32,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:32,156 INFO L93 Difference]: Finished difference Result 5971 states and 26705 transitions. [2020-02-10 20:03:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:32,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:32,171 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:03:32,171 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:03:32,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:03:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 20:03:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:03:32,372 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:03:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:32,372 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:03:32,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:03:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:32,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:32,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:32,378 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:32,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1435735170, now seen corresponding path program 251 times [2020-02-10 20:03:32,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:32,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952257525] [2020-02-10 20:03:32,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:32,921 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:03:33,050 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:33,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952257525] [2020-02-10 20:03:33,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:33,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:33,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204195304] [2020-02-10 20:03:33,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:33,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:33,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:33,061 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:03:33,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:33,287 INFO L93 Difference]: Finished difference Result 5966 states and 26695 transitions. [2020-02-10 20:03:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:33,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:33,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:33,301 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:03:33,301 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:03:33,302 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:03:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 20:03:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:03:33,511 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:03:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:33,511 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:03:33,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:03:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:33,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:33,517 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1169289222, now seen corresponding path program 252 times [2020-02-10 20:03:33,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:33,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913115892] [2020-02-10 20:03:33,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:34,058 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:34,193 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:34,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:03:34,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913115892] [2020-02-10 20:03:34,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:34,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:34,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322195552] [2020-02-10 20:03:34,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:34,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:34,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:34,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:34,204 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:03:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:34,438 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:03:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:34,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:34,453 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:03:34,453 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:03:34,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:34,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:03:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 20:03:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:03:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 20:03:34,656 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 20:03:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:34,656 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 20:03:34,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 20:03:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:34,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:34,662 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:34,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:34,662 INFO L82 PathProgramCache]: Analyzing trace with hash -645529018, now seen corresponding path program 253 times [2020-02-10 20:03:34,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:34,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382416467] [2020-02-10 20:03:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:35,244 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:35,369 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:35,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382416467] [2020-02-10 20:03:35,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:35,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:35,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060351837] [2020-02-10 20:03:35,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:35,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:35,380 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:03:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:35,618 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 20:03:35,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:35,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:35,632 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:03:35,633 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:03:35,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:03:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3128. [2020-02-10 20:03:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:03:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15599 transitions. [2020-02-10 20:03:35,838 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15599 transitions. Word has length 31 [2020-02-10 20:03:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:35,838 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15599 transitions. [2020-02-10 20:03:35,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15599 transitions. [2020-02-10 20:03:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:35,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:35,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:35,843 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1912986196, now seen corresponding path program 254 times [2020-02-10 20:03:35,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:35,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215497516] [2020-02-10 20:03:35,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:36,375 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:36,508 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:36,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:03:36,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215497516] [2020-02-10 20:03:36,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:36,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:36,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622968567] [2020-02-10 20:03:36,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:36,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:36,519 INFO L87 Difference]: Start difference. First operand 3128 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:03:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:36,751 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 20:03:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:36,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:36,766 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:03:36,766 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:03:36,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:03:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3120. [2020-02-10 20:03:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:03:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15578 transitions. [2020-02-10 20:03:36,971 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15578 transitions. Word has length 31 [2020-02-10 20:03:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:36,971 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15578 transitions. [2020-02-10 20:03:36,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15578 transitions. [2020-02-10 20:03:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:36,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:36,976 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:36,976 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1069840254, now seen corresponding path program 255 times [2020-02-10 20:03:36,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:36,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788761704] [2020-02-10 20:03:36,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:37,498 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:37,629 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03: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:03:37,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788761704] [2020-02-10 20:03:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:37,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:37,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481646897] [2020-02-10 20:03:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:37,640 INFO L87 Difference]: Start difference. First operand 3120 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:03:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:37,897 INFO L93 Difference]: Finished difference Result 5982 states and 26733 transitions. [2020-02-10 20:03:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:37,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:37,912 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:03:37,912 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:03:37,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:03:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3126. [2020-02-10 20:03:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:03:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-02-10 20:03:38,119 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-02-10 20:03:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:38,119 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-02-10 20:03:38,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-02-10 20:03:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:38,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:38,125 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:38,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:38,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1112698412, now seen corresponding path program 256 times [2020-02-10 20:03:38,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:38,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72781413] [2020-02-10 20:03:38,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:38,664 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:38,798 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:38,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72781413] [2020-02-10 20:03:38,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:38,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:38,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733695392] [2020-02-10 20:03:38,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:38,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:38,809 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:03:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:39,055 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 20:03:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:39,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:39,069 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:03:39,070 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:03:39,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:03:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3120. [2020-02-10 20:03:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:03:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:03:39,274 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:03:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:39,274 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:03:39,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:03:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:39,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:39,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:39,280 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203010, now seen corresponding path program 257 times [2020-02-10 20:03:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:39,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401984878] [2020-02-10 20:03:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:39,824 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:39,956 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:39,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401984878] [2020-02-10 20:03:39,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:39,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:39,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753140106] [2020-02-10 20:03:39,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:39,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:39,966 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:03:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:40,243 INFO L93 Difference]: Finished difference Result 5984 states and 26731 transitions. [2020-02-10 20:03:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:40,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:40,257 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:03:40,257 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:03:40,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:03:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 20:03:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:03:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 20:03:40,458 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 20:03:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:40,458 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 20:03:40,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 20:03:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:40,463 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:40,463 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash 476231558, now seen corresponding path program 258 times [2020-02-10 20:03:40,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:40,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449695539] [2020-02-10 20:03:40,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:40,997 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:03:41,127 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:41,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:03:41,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449695539] [2020-02-10 20:03:41,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:41,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:41,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708056380] [2020-02-10 20:03:41,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:41,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:41,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:41,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:41,137 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:03:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:41,403 INFO L93 Difference]: Finished difference Result 5981 states and 26719 transitions. [2020-02-10 20:03:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:41,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:41,419 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:03:41,419 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:03:41,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:03:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 20:03:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:03:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:03:41,626 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:03:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:41,626 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:03:41,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:03:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:41,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:41,631 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash 732940072, now seen corresponding path program 259 times [2020-02-10 20:03:41,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:41,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109513648] [2020-02-10 20:03:41,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:42,163 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:42,296 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03:42,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:03:42,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109513648] [2020-02-10 20:03:42,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:42,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:42,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914244577] [2020-02-10 20:03:42,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:42,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:42,306 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:03:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:42,548 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:03:42,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:42,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:42,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:42,562 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:03:42,563 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:03:42,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:42,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:03:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 20:03:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:03:42,807 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:03:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:42,807 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:03:42,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:03:42,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:42,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:42,813 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:42,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:42,814 INFO L82 PathProgramCache]: Analyzing trace with hash -112031380, now seen corresponding path program 260 times [2020-02-10 20:03:42,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:42,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803550760] [2020-02-10 20:03:42,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:43,472 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03:43,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:03:43,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803550760] [2020-02-10 20:03:43,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:43,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:43,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097996027] [2020-02-10 20:03:43,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:43,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:43,481 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:03:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:43,775 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 20:03:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:43,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:43,790 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:03:43,790 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:03:43,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:03:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 20:03:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:03:43,995 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:03:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:43,995 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:03:43,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:03:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:44,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:44,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:44,001 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 308628836, now seen corresponding path program 261 times [2020-02-10 20:03:44,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:44,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68902377] [2020-02-10 20:03:44,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:44,536 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:44,667 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:03: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:03:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68902377] [2020-02-10 20:03:44,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:44,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:44,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302212940] [2020-02-10 20:03:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:44,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:44,677 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:03:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:44,980 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:03:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:44,981 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:44,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:44,996 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:03:44,996 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:03:44,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:03:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 20:03:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:03:45,204 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:03:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:45,204 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:03:45,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:03:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:45,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:45,209 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:45,209 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1381314068, now seen corresponding path program 262 times [2020-02-10 20:03:45,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:45,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270691917] [2020-02-10 20:03:45,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:45,756 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:03:45,884 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:45,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:03:45,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270691917] [2020-02-10 20:03:45,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:45,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:45,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851526760] [2020-02-10 20:03:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:45,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:45,895 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:03:46,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:46,121 INFO L93 Difference]: Finished difference Result 5968 states and 26689 transitions. [2020-02-10 20:03:46,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:46,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:46,136 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:03:46,136 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:03:46,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:03:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 20:03:46,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:03:46,336 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:03:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:46,336 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:03:46,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:03:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:46,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:46,342 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:46,342 INFO L82 PathProgramCache]: Analyzing trace with hash -960653852, now seen corresponding path program 263 times [2020-02-10 20:03:46,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:46,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190856026] [2020-02-10 20:03:46,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:46,882 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:47,014 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03: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:03:47,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190856026] [2020-02-10 20:03:47,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:47,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:47,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626179915] [2020-02-10 20:03:47,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:47,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:47,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:47,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:47,024 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:03:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:47,301 INFO L93 Difference]: Finished difference Result 5976 states and 26706 transitions. [2020-02-10 20:03:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:47,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:47,315 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:03:47,316 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:03:47,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:03:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3125. [2020-02-10 20:03:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:03:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:03:47,521 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:03:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:47,521 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:03:47,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:03:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:47,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:47,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:47,526 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1805625304, now seen corresponding path program 264 times [2020-02-10 20:03:47,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:47,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970951905] [2020-02-10 20:03:47,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:48,068 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:03:48,199 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:48,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:03:48,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970951905] [2020-02-10 20:03:48,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:48,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:48,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914598989] [2020-02-10 20:03:48,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:48,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:48,210 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:03:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:48,491 INFO L93 Difference]: Finished difference Result 5973 states and 26694 transitions. [2020-02-10 20:03:48,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:48,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:48,506 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:03:48,506 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:03:48,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:03:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3109. [2020-02-10 20:03:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:03:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15542 transitions. [2020-02-10 20:03:48,707 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15542 transitions. Word has length 31 [2020-02-10 20:03:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:48,707 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15542 transitions. [2020-02-10 20:03:48,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15542 transitions. [2020-02-10 20:03:48,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:48,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:48,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:48,712 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash 575070398, now seen corresponding path program 265 times [2020-02-10 20:03:48,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:48,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667510652] [2020-02-10 20:03:48,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:49,244 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:49,374 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:49,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:03:49,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667510652] [2020-02-10 20:03:49,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:49,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:49,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670177617] [2020-02-10 20:03:49,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:49,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:49,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:49,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:49,384 INFO L87 Difference]: Start difference. First operand 3109 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:03:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:49,691 INFO L93 Difference]: Finished difference Result 5980 states and 26739 transitions. [2020-02-10 20:03:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:49,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:49,706 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:03:49,706 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:03:49,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:03:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3124. [2020-02-10 20:03:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 20:03:49,912 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 20:03:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:49,912 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 20:03:49,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 20:03:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:49,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:49,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:49,917 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 152584672, now seen corresponding path program 266 times [2020-02-10 20:03:49,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:49,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175573177] [2020-02-10 20:03:49,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:50,366 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2020-02-10 20:03:50,490 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:03:50,622 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:50,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:03:50,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175573177] [2020-02-10 20:03:50,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:50,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:50,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762089442] [2020-02-10 20:03:50,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:50,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:50,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:50,633 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:03:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:50,988 INFO L93 Difference]: Finished difference Result 5977 states and 26728 transitions. [2020-02-10 20:03:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:50,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:51,003 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:03:51,003 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:03:51,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:03:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 20:03:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:03:51,210 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:03:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:51,210 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:03:51,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:03:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:51,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:51,215 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash 150759162, now seen corresponding path program 267 times [2020-02-10 20:03:51,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:51,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993655176] [2020-02-10 20:03:51,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:51,746 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:51,879 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:51,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993655176] [2020-02-10 20:03:51,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:51,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:51,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406955483] [2020-02-10 20:03:51,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:51,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:51,888 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:03:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:52,145 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 20:03:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:52,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:52,160 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:03:52,160 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:03:52,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:03:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3127. [2020-02-10 20:03:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:03:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 20:03:52,375 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 20:03:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:52,375 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 20:03:52,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 20:03:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:52,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:52,381 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1116698016, now seen corresponding path program 268 times [2020-02-10 20:03:52,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:52,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433237605] [2020-02-10 20:03:52,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:53,042 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:53,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:03:53,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433237605] [2020-02-10 20:03:53,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:53,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:53,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937755449] [2020-02-10 20:03:53,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:53,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:53,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:53,052 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:03:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:53,317 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 20:03:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:53,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:53,332 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:03:53,332 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:03:53,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:03:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3119. [2020-02-10 20:03:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:03:53,537 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:03:53,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:53,537 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:03:53,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:03:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:53,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:53,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:53,543 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash -483882182, now seen corresponding path program 269 times [2020-02-10 20:03:53,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:53,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872614198] [2020-02-10 20:03:53,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:54,070 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:03:54,203 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:54,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:03:54,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872614198] [2020-02-10 20:03:54,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:54,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:54,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613459924] [2020-02-10 20:03:54,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:54,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:54,213 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:03:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:54,477 INFO L93 Difference]: Finished difference Result 5978 states and 26725 transitions. [2020-02-10 20:03:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:54,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:54,492 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:03:54,492 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:03:54,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:03:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3124. [2020-02-10 20:03:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:03:54,693 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:03:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:54,693 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:03:54,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:03:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:54,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:54,699 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1328853634, now seen corresponding path program 270 times [2020-02-10 20:03:54,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:54,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390014276] [2020-02-10 20:03:54,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:55,236 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:55,366 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:03:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:55,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390014276] [2020-02-10 20:03:55,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:55,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:55,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772220321] [2020-02-10 20:03:55,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:55,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:55,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:55,377 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:03:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:55,645 INFO L93 Difference]: Finished difference Result 5982 states and 26728 transitions. [2020-02-10 20:03:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:55,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:55,660 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:03:55,661 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:03:55,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:03:55,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 20:03:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:03:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 20:03:55,866 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 20:03:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:55,866 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 20:03:55,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 20:03:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:55,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:55,872 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash 37577542, now seen corresponding path program 271 times [2020-02-10 20:03:55,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:55,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783133599] [2020-02-10 20:03:55,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:56,400 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:56,535 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:56,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:03:56,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783133599] [2020-02-10 20:03:56,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:56,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:56,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570157238] [2020-02-10 20:03:56,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:56,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:56,545 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:03:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:56,830 INFO L93 Difference]: Finished difference Result 5977 states and 26727 transitions. [2020-02-10 20:03:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:56,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:56,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:56,845 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:03:56,846 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:03:56,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:03:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:03:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:03:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:03:57,052 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:03:57,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:57,052 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:03:57,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:03:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:57,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:57,057 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:57,057 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:57,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:57,057 INFO L82 PathProgramCache]: Analyzing trace with hash -384908184, now seen corresponding path program 272 times [2020-02-10 20:03:57,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:57,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425317846] [2020-02-10 20:03:57,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:57,595 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:03:57,728 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:57,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425317846] [2020-02-10 20:03:57,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:57,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:57,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382064332] [2020-02-10 20:03:57,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:57,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:57,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:57,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:57,738 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:03:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:57,988 INFO L93 Difference]: Finished difference Result 5974 states and 26716 transitions. [2020-02-10 20:03:57,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:57,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:57,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:58,003 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:03:58,003 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 20:03:58,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 20:03:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 20:03:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:03:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:03:58,242 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:03:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:58,243 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:03:58,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:03:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:58,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:58,248 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1235356166, now seen corresponding path program 273 times [2020-02-10 20:03:58,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:58,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476767301] [2020-02-10 20:03:58,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:58,788 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:03:58,918 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:03:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:03:58,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476767301] [2020-02-10 20:03:58,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:03:58,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:03:58,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983348165] [2020-02-10 20:03:58,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:03:58,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:03:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:03:58,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:03:58,928 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:03:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:03:59,163 INFO L93 Difference]: Finished difference Result 5981 states and 26732 transitions. [2020-02-10 20:03:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:03:59,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:03:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:03:59,178 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:03:59,179 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:03:59,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:03:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:03:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3126. [2020-02-10 20:03:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:03:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:03:59,385 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:03:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:03:59,385 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:03:59,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:03:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:03:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:03:59,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:03:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:03:59,390 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:03:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:03:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 102211048, now seen corresponding path program 274 times [2020-02-10 20:03:59,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:03:59,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961680302] [2020-02-10 20:03:59,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:03:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:03:59,919 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:00,052 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:00,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:04:00,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961680302] [2020-02-10 20:04:00,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:00,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:00,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463511603] [2020-02-10 20:04:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:00,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:00,061 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:04:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:00,285 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 20:04:00,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:00,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:00,300 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:04:00,301 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:04:00,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:04:00,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 20:04:00,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:04:00,504 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:04:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:00,504 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:04:00,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:04:00,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:00,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:00,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:00,509 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:00,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1869997510, now seen corresponding path program 275 times [2020-02-10 20:04:00,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:00,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82111965] [2020-02-10 20:04:00,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:01,033 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:01,164 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:01,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:01,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82111965] [2020-02-10 20:04:01,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:01,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:01,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993490664] [2020-02-10 20:04:01,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:01,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:01,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:01,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:01,174 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:04:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:01,417 INFO L93 Difference]: Finished difference Result 5973 states and 26709 transitions. [2020-02-10 20:04:01,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:01,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:01,432 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:04:01,432 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:04:01,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:04:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 20:04:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:04:01,631 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:04:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:01,632 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:04:01,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:04:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:01,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:01,637 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:01,637 INFO L82 PathProgramCache]: Analyzing trace with hash -109944570, now seen corresponding path program 276 times [2020-02-10 20:04:01,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:01,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648239197] [2020-02-10 20:04:01,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:02,165 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:02,294 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:02,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648239197] [2020-02-10 20:04:02,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:02,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:02,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10155099] [2020-02-10 20:04:02,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:02,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:02,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:02,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:02,304 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:04:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:02,528 INFO L93 Difference]: Finished difference Result 5975 states and 26708 transitions. [2020-02-10 20:04:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:02,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:02,544 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 20:04:02,544 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:04:02,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:04:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3114. [2020-02-10 20:04:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:04:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:04:02,747 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:04:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:02,747 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:04:02,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:04:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:02,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:02,753 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -655480122, now seen corresponding path program 277 times [2020-02-10 20:04:02,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:02,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275172938] [2020-02-10 20:04:02,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:03,294 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:03,428 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:03,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:04:03,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275172938] [2020-02-10 20:04:03,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:03,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:03,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848588648] [2020-02-10 20:04:03,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:03,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:03,438 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:04:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:03,669 INFO L93 Difference]: Finished difference Result 5995 states and 26770 transitions. [2020-02-10 20:04:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:03,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:03,684 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:04:03,685 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:04:03,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:04:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3129. [2020-02-10 20:04:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:04:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15598 transitions. [2020-02-10 20:04:03,886 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15598 transitions. Word has length 31 [2020-02-10 20:04:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:03,886 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15598 transitions. [2020-02-10 20:04:03,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15598 transitions. [2020-02-10 20:04:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:03,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:03,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:03,891 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1922937300, now seen corresponding path program 278 times [2020-02-10 20:04:03,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:03,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653456841] [2020-02-10 20:04:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:04,439 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:04,576 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:04,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:04:04,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653456841] [2020-02-10 20:04:04,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:04,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:04,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531199774] [2020-02-10 20:04:04,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:04,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:04,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:04,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:04,585 INFO L87 Difference]: Start difference. First operand 3129 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:04:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:04,892 INFO L93 Difference]: Finished difference Result 5996 states and 26764 transitions. [2020-02-10 20:04:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:04,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:04,907 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:04:04,907 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:04:04,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:04:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:04:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:04:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 20:04:05,107 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 20:04:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:05,107 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 20:04:05,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 20:04:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:05,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:05,113 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1504102594, now seen corresponding path program 279 times [2020-02-10 20:04:05,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:05,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64016851] [2020-02-10 20:04:05,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:05,686 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:05,818 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:05,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64016851] [2020-02-10 20:04:05,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:05,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:05,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950355308] [2020-02-10 20:04:05,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:05,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:05,829 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:04:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:06,076 INFO L93 Difference]: Finished difference Result 5992 states and 26756 transitions. [2020-02-10 20:04:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:06,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:06,092 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:04:06,092 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:04:06,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:04:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3128. [2020-02-10 20:04:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:04:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 20:04:06,292 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 20:04:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:06,292 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 20:04:06,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 20:04:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:06,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:06,297 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash -166535380, now seen corresponding path program 280 times [2020-02-10 20:04:06,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:06,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99108955] [2020-02-10 20:04:06,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:06,841 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:06,973 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:06,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99108955] [2020-02-10 20:04:06,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:06,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064108242] [2020-02-10 20:04:06,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:06,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:06,984 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:04:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:07,249 INFO L93 Difference]: Finished difference Result 5991 states and 26747 transitions. [2020-02-10 20:04:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:07,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:07,264 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:04:07,264 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:04:07,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:04:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 20:04:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:04:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15569 transitions. [2020-02-10 20:04:07,468 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15569 transitions. Word has length 31 [2020-02-10 20:04:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:07,469 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15569 transitions. [2020-02-10 20:04:07,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15569 transitions. [2020-02-10 20:04:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:07,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:07,474 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:07,474 INFO L82 PathProgramCache]: Analyzing trace with hash 886940670, now seen corresponding path program 281 times [2020-02-10 20:04:07,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:07,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182109961] [2020-02-10 20:04:07,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:08,021 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:08,155 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:08,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:04:08,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182109961] [2020-02-10 20:04:08,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:08,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:08,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425596104] [2020-02-10 20:04:08,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:08,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:08,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:08,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:08,165 INFO L87 Difference]: Start difference. First operand 3121 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:04:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:08,386 INFO L93 Difference]: Finished difference Result 5994 states and 26753 transitions. [2020-02-10 20:04:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:08,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:08,402 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:04:08,402 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:04:08,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:04:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 20:04:08,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:04:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15582 transitions. [2020-02-10 20:04:08,608 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15582 transitions. Word has length 31 [2020-02-10 20:04:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:08,608 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15582 transitions. [2020-02-10 20:04:08,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15582 transitions. [2020-02-10 20:04:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:08,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:08,613 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:08,613 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:08,613 INFO L82 PathProgramCache]: Analyzing trace with hash -803002234, now seen corresponding path program 282 times [2020-02-10 20:04:08,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:08,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287118829] [2020-02-10 20:04:08,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:09,155 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:04:09,284 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:09,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287118829] [2020-02-10 20:04:09,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:09,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:09,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440993568] [2020-02-10 20:04:09,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:09,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:09,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:09,294 INFO L87 Difference]: Start difference. First operand 3128 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:04:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:09,581 INFO L93 Difference]: Finished difference Result 5992 states and 26742 transitions. [2020-02-10 20:04:09,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:09,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:09,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:09,596 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:04:09,596 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:04:09,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:04:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3114. [2020-02-10 20:04:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:04:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 20:04:09,800 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 20:04:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:09,801 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 20:04:09,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 20:04:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:09,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:09,806 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 722988968, now seen corresponding path program 283 times [2020-02-10 20:04:09,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:09,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367227628] [2020-02-10 20:04:09,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:10,457 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:10,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:04:10,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367227628] [2020-02-10 20:04:10,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:10,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:10,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951741146] [2020-02-10 20:04:10,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:10,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:10,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:10,466 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:04:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:10,680 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 20:04:10,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:10,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:10,695 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:04:10,695 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:04:10,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:04:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3124. [2020-02-10 20:04:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:10,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:04:10,894 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:04:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:10,894 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:04:10,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:04:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:10,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:10,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:10,899 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash -121982484, now seen corresponding path program 284 times [2020-02-10 20:04:10,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:10,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389805023] [2020-02-10 20:04:10,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:11,544 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:11,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:04:11,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389805023] [2020-02-10 20:04:11,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:11,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:11,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019494847] [2020-02-10 20:04:11,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:11,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:11,554 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:04:11,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:11,780 INFO L93 Difference]: Finished difference Result 5980 states and 26718 transitions. [2020-02-10 20:04:11,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:11,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:11,795 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:04:11,795 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:04:11,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:04:11,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 20:04:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:04:11,996 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:04:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:11,996 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:04:11,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:04:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:12,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:12,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:12,001 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -125633504, now seen corresponding path program 285 times [2020-02-10 20:04:12,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:12,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899385053] [2020-02-10 20:04:12,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:12,531 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:12,660 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:12,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:04:12,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899385053] [2020-02-10 20:04:12,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:12,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:12,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378075342] [2020-02-10 20:04:12,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:12,670 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:04:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:12,955 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 20:04:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:12,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:12,970 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:04:12,970 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:04:12,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:13,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:04:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:04:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:04:13,170 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:04:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:13,170 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:04:13,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:04:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:13,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:13,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:13,175 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1634419436, now seen corresponding path program 286 times [2020-02-10 20:04:13,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:13,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130197424] [2020-02-10 20:04:13,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:13,757 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:04:13,887 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:13,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:04:13,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130197424] [2020-02-10 20:04:13,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:13,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:13,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699586214] [2020-02-10 20:04:13,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:13,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:13,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:13,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:13,897 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:04:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:14,122 INFO L93 Difference]: Finished difference Result 5976 states and 26705 transitions. [2020-02-10 20:04:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:14,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:14,137 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:04:14,137 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 20:04:14,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 20:04:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 20:04:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:04:14,337 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:04:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:14,338 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:04:14,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:04:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:14,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:14,343 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1394916192, now seen corresponding path program 287 times [2020-02-10 20:04:14,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:14,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578090834] [2020-02-10 20:04:14,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:14,870 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:04:15,001 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:15,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:04:15,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578090834] [2020-02-10 20:04:15,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:15,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:15,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31150323] [2020-02-10 20:04:15,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:15,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:15,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:15,011 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:04:15,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:15,295 INFO L93 Difference]: Finished difference Result 5984 states and 26723 transitions. [2020-02-10 20:04:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:15,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:15,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:15,310 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:04:15,310 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:04:15,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:04:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 20:04:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:04:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 20:04:15,516 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 20:04:15,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:15,516 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 20:04:15,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 20:04:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:15,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:15,522 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1210108200, now seen corresponding path program 288 times [2020-02-10 20:04:15,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:15,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724308480] [2020-02-10 20:04:15,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:16,068 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:04:16,201 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:04:16,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:04:16,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724308480] [2020-02-10 20:04:16,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:16,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:16,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679056514] [2020-02-10 20:04:16,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:16,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:16,211 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:04:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:16,465 INFO L93 Difference]: Finished difference Result 5982 states and 26712 transitions. [2020-02-10 20:04:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:16,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:16,480 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:04:16,480 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:04:16,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:04:16,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3109. [2020-02-10 20:04:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:04:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15537 transitions. [2020-02-10 20:04:16,679 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15537 transitions. Word has length 31 [2020-02-10 20:04:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:16,679 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15537 transitions. [2020-02-10 20:04:16,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15537 transitions. [2020-02-10 20:04:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:16,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:16,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:16,685 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 565119294, now seen corresponding path program 289 times [2020-02-10 20:04:16,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:16,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079023525] [2020-02-10 20:04:16,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:17,219 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:17,352 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:17,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079023525] [2020-02-10 20:04:17,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:17,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:17,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072983974] [2020-02-10 20:04:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:17,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:17,362 INFO L87 Difference]: Start difference. First operand 3109 states and 15537 transitions. Second operand 12 states. [2020-02-10 20:04:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:17,696 INFO L93 Difference]: Finished difference Result 5968 states and 26703 transitions. [2020-02-10 20:04:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:17,697 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:17,711 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:04:17,711 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:04:17,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:04:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 20:04:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:04:17,918 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:04:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:17,918 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:04:17,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:04:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:17,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:17,923 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:17,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:17,924 INFO L82 PathProgramCache]: Analyzing trace with hash 142633568, now seen corresponding path program 290 times [2020-02-10 20:04:17,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:17,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284543652] [2020-02-10 20:04:17,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:18,456 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:04:18,584 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:18,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284543652] [2020-02-10 20:04:18,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:18,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:18,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483183002] [2020-02-10 20:04:18,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:18,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:18,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:18,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:18,595 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:04:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:18,838 INFO L93 Difference]: Finished difference Result 5965 states and 26692 transitions. [2020-02-10 20:04:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:18,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:18,853 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:04:18,854 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:04:18,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:04:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 20:04:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:04:19,055 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:04:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:19,056 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:04:19,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:04:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:19,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:19,061 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -283503178, now seen corresponding path program 291 times [2020-02-10 20:04:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:19,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723608050] [2020-02-10 20:04:19,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:19,605 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:19,740 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:19,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723608050] [2020-02-10 20:04:19,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:19,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:19,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756688255] [2020-02-10 20:04:19,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:19,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:19,750 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:04:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:20,066 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:04:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:20,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:20,082 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:04:20,082 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:04:20,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:04:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3125. [2020-02-10 20:04:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:04:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 20:04:20,293 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 20:04:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:20,294 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 20:04:20,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 20:04:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:20,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:20,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:20,301 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1899035488, now seen corresponding path program 292 times [2020-02-10 20:04:20,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:20,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359203251] [2020-02-10 20:04:20,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:20,831 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:20,965 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:20,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359203251] [2020-02-10 20:04:20,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:20,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:20,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344305491] [2020-02-10 20:04:20,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:20,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:20,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:20,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:20,976 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:04:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:21,229 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 20:04:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:21,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:21,244 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:04:21,245 INFO L226 Difference]: Without dead ends: 5945 [2020-02-10 20:04:21,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:21,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5945 states. [2020-02-10 20:04:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5945 to 3119. [2020-02-10 20:04:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:04:21,491 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:04:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:21,491 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:04:21,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:04:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:21,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:21,496 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:21,496 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -918144522, now seen corresponding path program 293 times [2020-02-10 20:04:21,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:21,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537625410] [2020-02-10 20:04:21,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:22,045 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:04:22,175 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:22,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:04:22,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537625410] [2020-02-10 20:04:22,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:22,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:22,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328721654] [2020-02-10 20:04:22,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:22,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:22,186 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:04:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:22,419 INFO L93 Difference]: Finished difference Result 5963 states and 26683 transitions. [2020-02-10 20:04:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:22,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:22,435 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:04:22,435 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:04:22,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:04:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:04:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:22,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:04:22,640 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:04:22,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:22,641 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:04:22,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:22,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:04:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:22,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:22,646 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:22,646 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:22,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:22,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1686879870, now seen corresponding path program 294 times [2020-02-10 20:04:22,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:22,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395172269] [2020-02-10 20:04:22,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:23,187 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:23,319 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:23,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395172269] [2020-02-10 20:04:23,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:23,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:23,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777497613] [2020-02-10 20:04:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:23,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:23,328 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:04:23,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:23,564 INFO L93 Difference]: Finished difference Result 5964 states and 26680 transitions. [2020-02-10 20:04:23,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:23,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:23,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:23,579 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:04:23,580 INFO L226 Difference]: Without dead ends: 5937 [2020-02-10 20:04:23,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2020-02-10 20:04:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 3114. [2020-02-10 20:04:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:04:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:04:23,783 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:04:23,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:23,784 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:04:23,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:23,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:04:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:23,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:23,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:23,789 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:23,789 INFO L82 PathProgramCache]: Analyzing trace with hash 296372866, now seen corresponding path program 295 times [2020-02-10 20:04:23,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:23,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819306314] [2020-02-10 20:04:23,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:24,321 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:24,454 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:24,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:04:24,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819306314] [2020-02-10 20:04:24,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:24,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:24,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891280513] [2020-02-10 20:04:24,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:24,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:24,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:24,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:24,464 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:04:24,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:24,714 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:04:24,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:24,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:24,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:24,728 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:04:24,728 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:04:24,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:04:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 20:04:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:04:24,932 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:04:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:24,932 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:04:24,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:04:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:24,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:24,937 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash -126112860, now seen corresponding path program 296 times [2020-02-10 20:04:24,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:24,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425553440] [2020-02-10 20:04:24,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:25,474 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:04:25,606 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:25,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:04:25,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425553440] [2020-02-10 20:04:25,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:25,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:25,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144199528] [2020-02-10 20:04:25,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:25,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:25,615 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:04:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:25,845 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:04:25,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:25,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:25,860 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:04:25,860 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:04:25,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:26,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:04:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 20:04:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:04:26,059 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:04:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:26,059 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:04:26,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:04:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:26,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:26,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:26,065 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:26,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:26,065 INFO L82 PathProgramCache]: Analyzing trace with hash -976560842, now seen corresponding path program 297 times [2020-02-10 20:04:26,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:26,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737000198] [2020-02-10 20:04:26,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:26,600 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:26,727 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:26,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:04:26,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737000198] [2020-02-10 20:04:26,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:26,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:26,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054215821] [2020-02-10 20:04:26,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:26,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:26,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:26,738 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:04:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:26,967 INFO L93 Difference]: Finished difference Result 5974 states and 26708 transitions. [2020-02-10 20:04:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:26,968 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:26,982 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:04:26,982 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:04:26,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:04:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3126. [2020-02-10 20:04:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:04:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 20:04:27,188 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 20:04:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:27,189 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 20:04:27,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 20:04:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:27,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:27,194 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:27,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:27,194 INFO L82 PathProgramCache]: Analyzing trace with hash 361006372, now seen corresponding path program 298 times [2020-02-10 20:04:27,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:27,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847568863] [2020-02-10 20:04:27,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:27,730 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:27,861 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:27,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:04:27,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847568863] [2020-02-10 20:04:27,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:27,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:27,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283283930] [2020-02-10 20:04:27,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:27,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:27,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:27,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:27,871 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:04:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:28,122 INFO L93 Difference]: Finished difference Result 5973 states and 26699 transitions. [2020-02-10 20:04:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:28,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:28,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:28,136 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:04:28,136 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:04:28,137 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:04:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 20:04:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:04:28,340 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:04:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:28,340 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:04:28,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:04:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:28,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:28,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:28,345 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1611202186, now seen corresponding path program 299 times [2020-02-10 20:04:28,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:28,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570452336] [2020-02-10 20:04:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:28,880 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:29,013 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:29,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:04:29,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570452336] [2020-02-10 20:04:29,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:29,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:29,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966306102] [2020-02-10 20:04:29,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:29,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:29,023 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:04:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:29,290 INFO L93 Difference]: Finished difference Result 5966 states and 26685 transitions. [2020-02-10 20:04:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:29,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:29,306 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:04:29,306 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:04:29,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:04:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 20:04:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:04:29,511 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:04:29,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:29,512 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:04:29,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:29,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:04:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:29,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:29,517 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 148850754, now seen corresponding path program 300 times [2020-02-10 20:04:29,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:29,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697184896] [2020-02-10 20:04:29,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:30,042 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:30,171 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:30,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:04:30,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697184896] [2020-02-10 20:04:30,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:30,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:30,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849731588] [2020-02-10 20:04:30,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:30,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:30,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:30,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:30,181 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:04:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:30,432 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 20:04:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:30,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:30,447 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:04:30,447 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:04:30,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:04:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 20:04:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:04:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 20:04:30,651 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 20:04:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:30,651 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 20:04:30,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 20:04:30,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:30,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:30,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:30,657 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1089742462, now seen corresponding path program 301 times [2020-02-10 20:04:30,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:30,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52721752] [2020-02-10 20:04:30,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:31,202 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:31,334 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:31,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52721752] [2020-02-10 20:04:31,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:31,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:31,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326371489] [2020-02-10 20:04:31,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:31,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:31,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:31,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:31,343 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:04:31,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:31,632 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 20:04:31,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:31,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:31,648 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:04:31,648 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:04:31,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:31,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:04:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3126. [2020-02-10 20:04:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:04:31,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15585 transitions. [2020-02-10 20:04:31,851 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15585 transitions. Word has length 31 [2020-02-10 20:04:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:31,851 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15585 transitions. [2020-02-10 20:04:31,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15585 transitions. [2020-02-10 20:04:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:31,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:31,856 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:31,857 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1092796204, now seen corresponding path program 302 times [2020-02-10 20:04:31,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:31,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79481681] [2020-02-10 20:04:31,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:32,528 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:32,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:04:32,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79481681] [2020-02-10 20:04:32,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:32,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:32,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219736964] [2020-02-10 20:04:32,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:32,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:32,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:32,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:32,538 INFO L87 Difference]: Start difference. First operand 3126 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:04:32,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:32,826 INFO L93 Difference]: Finished difference Result 5974 states and 26705 transitions. [2020-02-10 20:04:32,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:32,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:32,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:32,841 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:04:32,841 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:04:32,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:04:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3120. [2020-02-10 20:04:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:04:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 20:04:33,040 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 20:04:33,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:33,041 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 20:04:33,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 20:04:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:33,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:33,046 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:33,046 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:33,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:33,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1514053698, now seen corresponding path program 303 times [2020-02-10 20:04:33,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:33,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092476562] [2020-02-10 20:04:33,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:33,595 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:33,727 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:04:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:33,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092476562] [2020-02-10 20:04:33,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:33,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:33,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622167394] [2020-02-10 20:04:33,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:33,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:33,738 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:04:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:34,032 INFO L93 Difference]: Finished difference Result 5978 states and 26714 transitions. [2020-02-10 20:04:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:34,032 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:34,047 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:04:34,047 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:04:34,047 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:04:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3127. [2020-02-10 20:04:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:04:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:04:34,252 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:04:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:34,252 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:04:34,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:04:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:34,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:34,257 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:34,258 INFO L82 PathProgramCache]: Analyzing trace with hash -176486484, now seen corresponding path program 304 times [2020-02-10 20:04:34,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:34,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042071295] [2020-02-10 20:04:34,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:34,806 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:34,936 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:34,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042071295] [2020-02-10 20:04:34,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:34,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:34,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603748375] [2020-02-10 20:04:34,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:34,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:34,947 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:04:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:35,196 INFO L93 Difference]: Finished difference Result 5977 states and 26705 transitions. [2020-02-10 20:04:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:35,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:35,211 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:04:35,211 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:04:35,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:04:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3120. [2020-02-10 20:04:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:04:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 20:04:35,417 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 20:04:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:35,417 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 20:04:35,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 20:04:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:35,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:35,422 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:35,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash -392293122, now seen corresponding path program 305 times [2020-02-10 20:04:35,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:35,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546274937] [2020-02-10 20:04:35,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:36,107 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:36,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:36,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546274937] [2020-02-10 20:04:36,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:36,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227251498] [2020-02-10 20:04:36,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:36,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:36,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:36,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:36,117 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:04:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:36,391 INFO L93 Difference]: Finished difference Result 5973 states and 26697 transitions. [2020-02-10 20:04:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:36,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:36,406 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:04:36,406 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:04:36,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:04:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3126. [2020-02-10 20:04:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:04:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 20:04:36,611 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 20:04:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:36,611 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 20:04:36,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 20:04:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:36,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:36,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:36,617 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1237264574, now seen corresponding path program 306 times [2020-02-10 20:04:36,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:36,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524680382] [2020-02-10 20:04:36,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:36,984 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:04:37,213 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:37,342 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:37,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524680382] [2020-02-10 20:04:37,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:37,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:37,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258115098] [2020-02-10 20:04:37,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:37,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:37,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:37,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:37,352 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:04:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:37,656 INFO L93 Difference]: Finished difference Result 5974 states and 26693 transitions. [2020-02-10 20:04:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:37,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:37,670 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:04:37,670 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:04:37,670 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:04:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3114. [2020-02-10 20:04:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:04:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 20:04:37,870 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 20:04:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:37,870 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 20:04:37,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 20:04:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:37,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:37,875 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:37,875 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:37,876 INFO L82 PathProgramCache]: Analyzing trace with hash 288726628, now seen corresponding path program 307 times [2020-02-10 20:04:37,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:37,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380066449] [2020-02-10 20:04:37,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:38,426 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:38,553 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 20:04:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:38,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380066449] [2020-02-10 20:04:38,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:38,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:38,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046917862] [2020-02-10 20:04:38,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:38,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:38,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:38,564 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:04:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:38,800 INFO L93 Difference]: Finished difference Result 5962 states and 26676 transitions. [2020-02-10 20:04:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:38,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:38,814 INFO L225 Difference]: With dead ends: 5962 [2020-02-10 20:04:38,814 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:04:38,815 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:04:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3124. [2020-02-10 20:04:39,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:04:39,014 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:04:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:39,014 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:04:39,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:04:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:39,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:39,019 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1401216276, now seen corresponding path program 308 times [2020-02-10 20:04:39,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:39,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784622093] [2020-02-10 20:04:39,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:39,576 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:39,705 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:39,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784622093] [2020-02-10 20:04:39,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:39,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:39,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948150365] [2020-02-10 20:04:39,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:39,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:39,716 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:04:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:39,949 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:04:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:39,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:39,964 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:04:39,965 INFO L226 Difference]: Without dead ends: 5941 [2020-02-10 20:04:39,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2020-02-10 20:04:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 3119. [2020-02-10 20:04:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:04:40,168 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:04:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:40,168 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:04:40,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:04:40,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:40,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:40,173 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:40,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:40,174 INFO L82 PathProgramCache]: Analyzing trace with hash -135584608, now seen corresponding path program 309 times [2020-02-10 20:04:40,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:40,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229656834] [2020-02-10 20:04:40,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:40,707 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:40,838 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:40,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:04:40,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229656834] [2020-02-10 20:04:40,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:40,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:40,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364343000] [2020-02-10 20:04:40,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:40,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:40,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:40,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:40,848 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:04:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:41,210 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:04:41,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:41,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:41,225 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:04:41,225 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:04:41,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:41,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:04:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:04:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:04:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:04:41,425 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:04:41,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:41,425 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:04:41,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:41,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:04:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:41,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:41,430 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:41,430 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:41,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1624468332, now seen corresponding path program 310 times [2020-02-10 20:04:41,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:41,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199026258] [2020-02-10 20:04:41,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:41,977 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:42,111 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:42,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:04:42,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199026258] [2020-02-10 20:04:42,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:42,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:42,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167770244] [2020-02-10 20:04:42,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:42,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:42,121 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:04:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:42,478 INFO L93 Difference]: Finished difference Result 5965 states and 26672 transitions. [2020-02-10 20:04:42,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:42,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:42,493 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:04:42,493 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 20:04:42,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 20:04:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 20:04:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:04:42,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:04:42,693 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:04:42,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:42,693 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:04:42,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:04:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:42,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:42,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:42,699 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1620817312, now seen corresponding path program 311 times [2020-02-10 20:04:42,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:42,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109142142] [2020-02-10 20:04:42,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:43,251 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:43,382 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:43,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109142142] [2020-02-10 20:04:43,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:43,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:43,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997453624] [2020-02-10 20:04:43,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:43,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:43,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:43,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:43,392 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:04:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:43,651 INFO L93 Difference]: Finished difference Result 5966 states and 26675 transitions. [2020-02-10 20:04:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:43,651 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:43,665 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:04:43,665 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:04:43,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:04:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3125. [2020-02-10 20:04:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:04:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15566 transitions. [2020-02-10 20:04:43,865 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15566 transitions. Word has length 31 [2020-02-10 20:04:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:43,865 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15566 transitions. [2020-02-10 20:04:43,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15566 transitions. [2020-02-10 20:04:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:43,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:43,870 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:43,871 INFO L82 PathProgramCache]: Analyzing trace with hash 775845860, now seen corresponding path program 312 times [2020-02-10 20:04:43,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:43,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218130154] [2020-02-10 20:04:43,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:44,421 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:44,550 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:44,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:04:44,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218130154] [2020-02-10 20:04:44,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:44,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:44,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547192953] [2020-02-10 20:04:44,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:44,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:44,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:44,560 INFO L87 Difference]: Start difference. First operand 3125 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:04:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:44,920 INFO L93 Difference]: Finished difference Result 5967 states and 26671 transitions. [2020-02-10 20:04:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:44,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:44,936 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:04:44,936 INFO L226 Difference]: Without dead ends: 5933 [2020-02-10 20:04:44,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2020-02-10 20:04:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 3109. [2020-02-10 20:04:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:04:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15532 transitions. [2020-02-10 20:04:45,180 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15532 transitions. Word has length 31 [2020-02-10 20:04:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:45,180 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15532 transitions. [2020-02-10 20:04:45,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15532 transitions. [2020-02-10 20:04:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:45,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:45,186 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash 130856954, now seen corresponding path program 313 times [2020-02-10 20:04:45,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:45,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44889282] [2020-02-10 20:04:45,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:45,727 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:45,858 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:45,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:04:45,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44889282] [2020-02-10 20:04:45,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:45,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:45,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655446467] [2020-02-10 20:04:45,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:45,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:45,869 INFO L87 Difference]: Start difference. First operand 3109 states and 15532 transitions. Second operand 12 states. [2020-02-10 20:04:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:46,177 INFO L93 Difference]: Finished difference Result 5999 states and 26786 transitions. [2020-02-10 20:04:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:46,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:46,191 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:04:46,191 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:04:46,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:04:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3129. [2020-02-10 20:04:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:04:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15599 transitions. [2020-02-10 20:04:46,392 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15599 transitions. Word has length 31 [2020-02-10 20:04:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:46,392 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15599 transitions. [2020-02-10 20:04:46,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15599 transitions. [2020-02-10 20:04:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:46,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:46,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:46,397 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1136600224, now seen corresponding path program 314 times [2020-02-10 20:04:46,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:46,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651507769] [2020-02-10 20:04:46,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:46,932 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:47,062 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:47,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:04:47,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651507769] [2020-02-10 20:04:47,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:47,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:47,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138468431] [2020-02-10 20:04:47,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:47,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:47,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:47,073 INFO L87 Difference]: Start difference. First operand 3129 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:04:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:47,431 INFO L93 Difference]: Finished difference Result 6000 states and 26780 transitions. [2020-02-10 20:04:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:47,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:47,446 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:04:47,446 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:04:47,446 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:04:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3121. [2020-02-10 20:04:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:04:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 20:04:47,653 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 20:04:47,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:47,653 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 20:04:47,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 20:04:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:47,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:47,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:47,659 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:47,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash -293454282, now seen corresponding path program 315 times [2020-02-10 20:04:47,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:47,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726632759] [2020-02-10 20:04:47,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:48,325 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:48,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:04:48,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726632759] [2020-02-10 20:04:48,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:48,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:48,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689692360] [2020-02-10 20:04:48,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:48,334 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:04:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:48,557 INFO L93 Difference]: Finished difference Result 5994 states and 26768 transitions. [2020-02-10 20:04:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:48,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:48,572 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:04:48,572 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:04:48,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:04:48,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3127. [2020-02-10 20:04:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:04:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15589 transitions. [2020-02-10 20:04:48,772 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15589 transitions. Word has length 31 [2020-02-10 20:04:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:48,772 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15589 transitions. [2020-02-10 20:04:48,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15589 transitions. [2020-02-10 20:04:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:48,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:48,777 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1889084384, now seen corresponding path program 316 times [2020-02-10 20:04:48,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:48,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798051687] [2020-02-10 20:04:48,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:49,319 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:49,451 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:49,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:04:49,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798051687] [2020-02-10 20:04:49,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:49,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:49,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311451725] [2020-02-10 20:04:49,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:49,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:49,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:49,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:49,461 INFO L87 Difference]: Start difference. First operand 3127 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:04:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:49,693 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-02-10 20:04:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:49,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:49,708 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:04:49,708 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:04:49,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:04:49,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:04:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:04:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15572 transitions. [2020-02-10 20:04:49,911 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15572 transitions. Word has length 31 [2020-02-10 20:04:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:49,911 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15572 transitions. [2020-02-10 20:04:49,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:49,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15572 transitions. [2020-02-10 20:04:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:49,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:49,917 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:49,917 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2097588982, now seen corresponding path program 317 times [2020-02-10 20:04:49,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:49,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798374324] [2020-02-10 20:04:49,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:50,462 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:04:50,600 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:50,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:04:50,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798374324] [2020-02-10 20:04:50,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:50,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:50,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593098829] [2020-02-10 20:04:50,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:50,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:50,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:50,609 INFO L87 Difference]: Start difference. First operand 3121 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:04:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:50,820 INFO L93 Difference]: Finished difference Result 5996 states and 26766 transitions. [2020-02-10 20:04:50,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:50,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:50,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:50,834 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:04:50,835 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:04:50,835 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:04:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 20:04:51,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:04:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 20:04:51,035 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 20:04:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:51,035 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 20:04:51,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 20:04:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:51,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:51,040 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:51,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1252617530, now seen corresponding path program 318 times [2020-02-10 20:04:51,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:51,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748169786] [2020-02-10 20:04:51,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:51,587 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:51,718 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:51,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748169786] [2020-02-10 20:04:51,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:51,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:51,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183758966] [2020-02-10 20:04:51,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:51,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:51,729 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:04:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:51,947 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 20:04:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:51,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:51,962 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:04:51,962 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:04:51,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:04:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3115. [2020-02-10 20:04:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:04:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 20:04:52,170 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 20:04:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:52,170 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 20:04:52,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 20:04:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:52,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:52,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:52,176 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash -137889474, now seen corresponding path program 319 times [2020-02-10 20:04:52,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:52,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912004484] [2020-02-10 20:04:52,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:52,732 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:52,866 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:04:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:52,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912004484] [2020-02-10 20:04:52,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:52,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:52,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614236952] [2020-02-10 20:04:52,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:52,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:52,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:52,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:52,876 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:04:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:53,148 INFO L93 Difference]: Finished difference Result 6003 states and 26792 transitions. [2020-02-10 20:04:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:53,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:53,164 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:04:53,164 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:04:53,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:04:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3130. [2020-02-10 20:04:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:04:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 20:04:53,367 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 20:04:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:53,368 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 20:04:53,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 20:04:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:53,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:53,373 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:53,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1405346652, now seen corresponding path program 320 times [2020-02-10 20:04:53,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:53,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844124386] [2020-02-10 20:04:53,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:53,916 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:54,043 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:54,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:04:54,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844124386] [2020-02-10 20:04:54,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:54,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:54,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686901040] [2020-02-10 20:04:54,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:54,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:54,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:54,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:54,053 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:04:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:54,285 INFO L93 Difference]: Finished difference Result 6004 states and 26786 transitions. [2020-02-10 20:04:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:54,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:54,300 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:04:54,301 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:04:54,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:04:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3122. [2020-02-10 20:04:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:04:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 20:04:54,500 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 20:04:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:54,500 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 20:04:54,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 20:04:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:54,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:54,505 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:54,505 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash -986511946, now seen corresponding path program 321 times [2020-02-10 20:04:54,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:54,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411678999] [2020-02-10 20:04:54,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:55,058 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:55,188 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:04:55,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:04:55,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411678999] [2020-02-10 20:04:55,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:55,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:55,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601559704] [2020-02-10 20:04:55,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:55,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:55,198 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:04:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:55,428 INFO L93 Difference]: Finished difference Result 6000 states and 26778 transitions. [2020-02-10 20:04:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:55,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:55,442 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:04:55,443 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:04:55,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:04:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3129. [2020-02-10 20:04:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:04:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:04:55,643 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:04:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:55,643 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:04:55,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:04:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:55,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:55,648 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:55,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:55,648 INFO L82 PathProgramCache]: Analyzing trace with hash 351055268, now seen corresponding path program 322 times [2020-02-10 20:04:55,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:55,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602839395] [2020-02-10 20:04:55,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:56,198 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:56,330 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:04:56,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:04:56,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602839395] [2020-02-10 20:04:56,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:56,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:56,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172216203] [2020-02-10 20:04:56,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:56,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:56,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:56,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:56,340 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:04:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:56,568 INFO L93 Difference]: Finished difference Result 5999 states and 26769 transitions. [2020-02-10 20:04:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:56,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:56,584 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:04:56,584 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:04:56,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:56,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:04:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3122. [2020-02-10 20:04:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:04:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:04:56,789 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:04:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:56,789 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:04:56,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:04:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:56,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:56,795 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1404531318, now seen corresponding path program 323 times [2020-02-10 20:04:56,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:56,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620755360] [2020-02-10 20:04:56,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:57,467 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:57,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620755360] [2020-02-10 20:04:57,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:57,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:57,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903333890] [2020-02-10 20:04:57,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:57,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:57,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:57,477 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:04:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:57,698 INFO L93 Difference]: Finished difference Result 6002 states and 26775 transitions. [2020-02-10 20:04:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:57,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:57,714 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:04:57,714 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:04:57,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:04:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3129. [2020-02-10 20:04:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:04:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 20:04:57,915 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 20:04:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:57,915 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 20:04:57,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 20:04:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:57,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:57,921 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash -285411586, now seen corresponding path program 324 times [2020-02-10 20:04:57,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:57,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840371223] [2020-02-10 20:04:57,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:58,462 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:04:58,592 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:04:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:58,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840371223] [2020-02-10 20:04:58,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:58,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:58,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402238908] [2020-02-10 20:04:58,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:58,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:58,603 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:04:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:04:58,877 INFO L93 Difference]: Finished difference Result 6000 states and 26764 transitions. [2020-02-10 20:04:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:04:58,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:04:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:04:58,893 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:04:58,893 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:04:58,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:04:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:04:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3115. [2020-02-10 20:04:59,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:04:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15549 transitions. [2020-02-10 20:04:59,093 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15549 transitions. Word has length 31 [2020-02-10 20:04:59,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:04:59,093 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15549 transitions. [2020-02-10 20:04:59,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:04:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15549 transitions. [2020-02-10 20:04:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:04:59,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:04:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:04:59,098 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:04:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:04:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash -830947138, now seen corresponding path program 325 times [2020-02-10 20:04:59,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:04:59,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812358800] [2020-02-10 20:04:59,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:04:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:04:59,641 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:04:59,774 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:04:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:04:59,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812358800] [2020-02-10 20:04:59,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:04:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:04:59,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265598334] [2020-02-10 20:04:59,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:04:59,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:04:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:04:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:04:59,784 INFO L87 Difference]: Start difference. First operand 3115 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:05:00,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:00,045 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 20:05:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:00,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:00,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:00,062 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:05:00,063 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:05:00,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:05:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:05:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 20:05:00,261 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 20:05:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:00,262 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 20:05:00,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 20:05:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:00,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:00,267 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:00,267 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1351591528, now seen corresponding path program 326 times [2020-02-10 20:05:00,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:00,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72462379] [2020-02-10 20:05:00,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:00,813 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:00,994 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:01,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:05:01,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72462379] [2020-02-10 20:05:01,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:01,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:01,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335912573] [2020-02-10 20:05:01,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:01,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:01,005 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:05:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:01,235 INFO L93 Difference]: Finished difference Result 5989 states and 26745 transitions. [2020-02-10 20:05:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:01,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:01,250 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:05:01,251 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:05:01,251 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:05:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 20:05:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:05:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15566 transitions. [2020-02-10 20:05:01,451 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15566 transitions. Word has length 31 [2020-02-10 20:05:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:01,451 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15566 transitions. [2020-02-10 20:05:01,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15566 transitions. [2020-02-10 20:05:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:01,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:01,457 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:01,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:01,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1255258374, now seen corresponding path program 327 times [2020-02-10 20:05:01,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:01,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986975564] [2020-02-10 20:05:01,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:02,003 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:02,132 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:05:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:02,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986975564] [2020-02-10 20:05:02,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:02,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:02,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114903940] [2020-02-10 20:05:02,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:02,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:02,143 INFO L87 Difference]: Start difference. First operand 3121 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:05:02,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:02,371 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 20:05:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:02,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:02,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:02,386 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:05:02,386 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:05:02,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:05:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 20:05:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:05:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 20:05:02,592 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 20:05:02,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:02,592 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 20:05:02,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 20:05:02,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:02,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:02,597 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:02,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:02,597 INFO L82 PathProgramCache]: Analyzing trace with hash 82308840, now seen corresponding path program 328 times [2020-02-10 20:05:02,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:02,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480289736] [2020-02-10 20:05:02,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:03,148 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:03,278 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:05:03,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:05:03,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480289736] [2020-02-10 20:05:03,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:03,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:03,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892775802] [2020-02-10 20:05:03,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:03,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:03,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:03,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:03,289 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:05:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:03,569 INFO L93 Difference]: Finished difference Result 5992 states and 26745 transitions. [2020-02-10 20:05:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:03,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:03,584 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:05:03,585 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 20:05:03,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 20:05:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3121. [2020-02-10 20:05:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:05:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 20:05:03,790 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 20:05:03,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:03,790 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 20:05:03,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 20:05:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:03,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:03,796 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash -133497798, now seen corresponding path program 329 times [2020-02-10 20:05:03,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:03,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000689622] [2020-02-10 20:05:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:04,348 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:04,479 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:05:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:04,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000689622] [2020-02-10 20:05:04,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:04,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:04,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059725354] [2020-02-10 20:05:04,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:04,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:04,490 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:05:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:04,719 INFO L93 Difference]: Finished difference Result 5988 states and 26737 transitions. [2020-02-10 20:05:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:04,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:04,734 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:05:04,734 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:05:04,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:05:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3127. [2020-02-10 20:05:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15571 transitions. [2020-02-10 20:05:04,934 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15571 transitions. Word has length 31 [2020-02-10 20:05:04,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:04,934 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15571 transitions. [2020-02-10 20:05:04,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15571 transitions. [2020-02-10 20:05:04,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:04,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:04,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:04,939 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:04,940 INFO L82 PathProgramCache]: Analyzing trace with hash -978469250, now seen corresponding path program 330 times [2020-02-10 20:05:04,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:04,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499656019] [2020-02-10 20:05:04,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:05,486 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:05,617 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:05:05,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:05:05,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499656019] [2020-02-10 20:05:05,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:05,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:05,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253612702] [2020-02-10 20:05:05,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:05,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:05,628 INFO L87 Difference]: Start difference. First operand 3127 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:05:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:05,858 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 20:05:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:05,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:05,873 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:05:05,873 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:05:05,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:05:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3115. [2020-02-10 20:05:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:05:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15543 transitions. [2020-02-10 20:05:06,080 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15543 transitions. Word has length 31 [2020-02-10 20:05:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:06,080 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15543 transitions. [2020-02-10 20:05:06,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15543 transitions. [2020-02-10 20:05:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:06,085 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:06,085 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:06,085 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -990507164, now seen corresponding path program 331 times [2020-02-10 20:05:06,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:06,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962084079] [2020-02-10 20:05:06,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:06,616 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:06,745 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:06,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:05:06,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962084079] [2020-02-10 20:05:06,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:06,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:06,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182222457] [2020-02-10 20:05:06,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:06,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:06,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:06,755 INFO L87 Difference]: Start difference. First operand 3115 states and 15543 transitions. Second operand 12 states. [2020-02-10 20:05:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:07,069 INFO L93 Difference]: Finished difference Result 5994 states and 26755 transitions. [2020-02-10 20:05:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:07,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:07,083 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:05:07,083 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:05:07,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:05:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 20:05:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15577 transitions. [2020-02-10 20:05:07,289 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15577 transitions. Word has length 31 [2020-02-10 20:05:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:07,290 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15577 transitions. [2020-02-10 20:05:07,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:07,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15577 transitions. [2020-02-10 20:05:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:07,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:07,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:07,295 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1835478616, now seen corresponding path program 332 times [2020-02-10 20:05:07,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:07,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808046753] [2020-02-10 20:05:07,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:07,846 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:07,980 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:07,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:05:07,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808046753] [2020-02-10 20:05:07,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:07,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:07,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339884536] [2020-02-10 20:05:07,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:07,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:07,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:07,989 INFO L87 Difference]: Start difference. First operand 3127 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:05:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:08,228 INFO L93 Difference]: Finished difference Result 5991 states and 26743 transitions. [2020-02-10 20:05:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:08,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:08,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:08,243 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:05:08,243 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:05:08,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:08,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:05:08,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:05:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:05:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 20:05:08,445 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 20:05:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:08,446 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 20:05:08,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 20:05:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:08,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:08,451 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1414818400, now seen corresponding path program 333 times [2020-02-10 20:05:08,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:08,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773185068] [2020-02-10 20:05:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:08,900 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-02-10 20:05:09,022 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:09,153 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:09,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773185068] [2020-02-10 20:05:09,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:09,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:09,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277052798] [2020-02-10 20:05:09,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:09,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:09,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:09,164 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:05:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:09,478 INFO L93 Difference]: Finished difference Result 5996 states and 26754 transitions. [2020-02-10 20:05:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:09,479 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:09,494 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:05:09,494 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:05:09,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:05:09,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 20:05:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:05:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:05:09,700 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:05:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:09,700 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:05:09,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:05:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:09,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:09,706 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1190205992, now seen corresponding path program 334 times [2020-02-10 20:05:09,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:09,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286529427] [2020-02-10 20:05:09,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:10,237 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:10,372 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:10,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286529427] [2020-02-10 20:05:10,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:10,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:10,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122094118] [2020-02-10 20:05:10,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:10,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:10,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:10,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:10,381 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:05:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:10,628 INFO L93 Difference]: Finished difference Result 5994 states and 26743 transitions. [2020-02-10 20:05:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:10,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:10,643 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:05:10,643 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:05:10,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:05:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:05:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:05:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15554 transitions. [2020-02-10 20:05:10,850 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15554 transitions. Word has length 31 [2020-02-10 20:05:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:10,850 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15554 transitions. [2020-02-10 20:05:10,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:10,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15554 transitions. [2020-02-10 20:05:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:10,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:10,855 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:10,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:10,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1610866208, now seen corresponding path program 335 times [2020-02-10 20:05:10,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:10,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995778217] [2020-02-10 20:05:10,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:11,406 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:11,536 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:11,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995778217] [2020-02-10 20:05:11,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:11,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:11,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846974741] [2020-02-10 20:05:11,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:11,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:11,546 INFO L87 Difference]: Start difference. First operand 3121 states and 15554 transitions. Second operand 12 states. [2020-02-10 20:05:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:11,842 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 20:05:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:11,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:11,857 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:05:11,857 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:05:11,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:05:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:05:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15565 transitions. [2020-02-10 20:05:12,057 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15565 transitions. Word has length 31 [2020-02-10 20:05:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:12,057 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15565 transitions. [2020-02-10 20:05:12,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15565 transitions. [2020-02-10 20:05:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:12,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:12,063 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:12,063 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 765894756, now seen corresponding path program 336 times [2020-02-10 20:05:12,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:12,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134972977] [2020-02-10 20:05:12,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:12,610 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:12,740 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:12,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:05:12,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134972977] [2020-02-10 20:05:12,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:12,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:12,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077749634] [2020-02-10 20:05:12,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:12,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:12,750 INFO L87 Difference]: Start difference. First operand 3127 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:05:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:13,001 INFO L93 Difference]: Finished difference Result 5990 states and 26729 transitions. [2020-02-10 20:05:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:13,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:13,016 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:05:13,016 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:05:13,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:05:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3109. [2020-02-10 20:05:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:05:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15527 transitions. [2020-02-10 20:05:13,218 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15527 transitions. Word has length 31 [2020-02-10 20:05:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:13,219 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15527 transitions. [2020-02-10 20:05:13,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15527 transitions. [2020-02-10 20:05:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:13,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:13,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:13,224 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash -508759942, now seen corresponding path program 337 times [2020-02-10 20:05:13,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:13,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697957490] [2020-02-10 20:05:13,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:13,756 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:13,884 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:13,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697957490] [2020-02-10 20:05:13,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:13,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:13,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968026401] [2020-02-10 20:05:13,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:13,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:13,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:13,894 INFO L87 Difference]: Start difference. First operand 3109 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:05:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:14,150 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 20:05:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:14,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:14,165 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:05:14,165 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:05:14,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:05:14,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:05:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:05:14,371 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:05:14,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:14,372 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:05:14,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:05:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:14,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:14,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:14,377 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:14,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:14,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1353731394, now seen corresponding path program 338 times [2020-02-10 20:05:14,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:14,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610808576] [2020-02-10 20:05:14,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:14,905 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:05:15,038 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:15,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:05:15,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610808576] [2020-02-10 20:05:15,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:15,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:15,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832905853] [2020-02-10 20:05:15,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:15,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:15,049 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:05:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:15,269 INFO L93 Difference]: Finished difference Result 5972 states and 26696 transitions. [2020-02-10 20:05:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:15,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:15,284 INFO L225 Difference]: With dead ends: 5972 [2020-02-10 20:05:15,284 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:05:15,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:05:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:05:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:05:15,483 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:05:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:15,484 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:05:15,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:15,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:05:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:15,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:15,489 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:15,489 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -933071178, now seen corresponding path program 339 times [2020-02-10 20:05:15,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:15,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985906747] [2020-02-10 20:05:15,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:16,034 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:16,162 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:16,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985906747] [2020-02-10 20:05:16,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:16,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:16,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721866139] [2020-02-10 20:05:16,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:16,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:16,173 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:05:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:16,397 INFO L93 Difference]: Finished difference Result 5965 states and 26682 transitions. [2020-02-10 20:05:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:16,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:16,410 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:05:16,410 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:05:16,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:05:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 20:05:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:05:16,611 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:05:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:16,611 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:05:16,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:05:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:16,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:16,616 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:16,616 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1671953214, now seen corresponding path program 340 times [2020-02-10 20:05:16,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:16,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800513649] [2020-02-10 20:05:16,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:17,198 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:17,330 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:17,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:05:17,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800513649] [2020-02-10 20:05:17,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:17,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:17,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327031765] [2020-02-10 20:05:17,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:17,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:17,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:17,340 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:05:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:17,564 INFO L93 Difference]: Finished difference Result 5966 states and 26679 transitions. [2020-02-10 20:05:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:17,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:17,579 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:05:17,579 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:05:17,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:05:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 20:05:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:05:17,789 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:05:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:17,789 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:05:17,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:05:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:17,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:17,794 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:17,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2092613430, now seen corresponding path program 341 times [2020-02-10 20:05:17,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:17,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881286674] [2020-02-10 20:05:17,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:18,314 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:18,439 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:18,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:05:18,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881286674] [2020-02-10 20:05:18,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:18,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:18,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394560787] [2020-02-10 20:05:18,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:18,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:18,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:18,450 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:05:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:18,711 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 20:05:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:18,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:18,727 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:05:18,727 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:05:18,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:05:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 20:05:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:05:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:05:18,927 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:05:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:18,927 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:05:18,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:05:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:18,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:18,933 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1247641978, now seen corresponding path program 342 times [2020-02-10 20:05:18,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:18,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943173604] [2020-02-10 20:05:18,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:19,470 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:19,601 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:19,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943173604] [2020-02-10 20:05:19,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:19,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:19,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373999084] [2020-02-10 20:05:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:19,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:19,611 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:05:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:19,921 INFO L93 Difference]: Finished difference Result 5971 states and 26684 transitions. [2020-02-10 20:05:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:19,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:19,936 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:05:19,937 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 20:05:19,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 20:05:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3114. [2020-02-10 20:05:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:05:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 20:05:20,143 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 20:05:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:20,143 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 20:05:20,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 20:05:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:20,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:20,148 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:20,148 INFO L82 PathProgramCache]: Analyzing trace with hash -777506370, now seen corresponding path program 343 times [2020-02-10 20:05:20,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:20,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593240650] [2020-02-10 20:05:20,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:20,670 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:20,804 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:20,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593240650] [2020-02-10 20:05:20,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:20,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:20,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200449367] [2020-02-10 20:05:20,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:20,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:20,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:20,814 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:05:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:21,039 INFO L93 Difference]: Finished difference Result 5970 states and 26693 transitions. [2020-02-10 20:05:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:21,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:21,055 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:05:21,055 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:05:21,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:21,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:05:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 20:05:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:05:21,260 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:05:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:21,260 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:05:21,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:05:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:21,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:21,265 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1622477822, now seen corresponding path program 344 times [2020-02-10 20:05:21,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:21,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350225227] [2020-02-10 20:05:21,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:21,793 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:21,924 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:21,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350225227] [2020-02-10 20:05:21,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:21,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:21,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616903015] [2020-02-10 20:05:21,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:21,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:21,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:21,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:21,934 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:05:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:22,216 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 20:05:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:22,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:22,231 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:05:22,231 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:05:22,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:05:22,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 20:05:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:05:22,436 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:05:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:22,436 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:05:22,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:05:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:22,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:22,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:22,441 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:22,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1626128842, now seen corresponding path program 345 times [2020-02-10 20:05:22,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:22,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129019569] [2020-02-10 20:05:22,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:22,966 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:23,099 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:23,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129019569] [2020-02-10 20:05:23,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:23,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:23,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898836712] [2020-02-10 20:05:23,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:23,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:23,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:23,109 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:05:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:23,397 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 20:05:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:23,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:23,411 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:05:23,412 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:05:23,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:05:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:05:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:05:23,618 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:05:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:23,618 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:05:23,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:05:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:23,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:23,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:23,624 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:23,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 133924098, now seen corresponding path program 346 times [2020-02-10 20:05:23,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:23,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030619921] [2020-02-10 20:05:23,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:24,147 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:05:24,278 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05: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:05:24,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030619921] [2020-02-10 20:05:24,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:24,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:24,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24207129] [2020-02-10 20:05:24,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:24,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:24,287 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:05:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:24,516 INFO L93 Difference]: Finished difference Result 5970 states and 26683 transitions. [2020-02-10 20:05:24,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:24,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:24,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:24,532 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:05:24,532 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:05:24,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:05:24,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:05:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:05:24,735 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:05:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:24,735 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:05:24,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:05:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:24,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:24,740 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:24,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:24,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1399555766, now seen corresponding path program 347 times [2020-02-10 20:05:24,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:24,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282476693] [2020-02-10 20:05:24,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:25,320 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:25,463 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:25,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:05:25,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282476693] [2020-02-10 20:05:25,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:25,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:25,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120501306] [2020-02-10 20:05:25,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:25,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:25,473 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:05:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:25,716 INFO L93 Difference]: Finished difference Result 5978 states and 26701 transitions. [2020-02-10 20:05:25,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:25,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:25,731 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:05:25,731 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:05:25,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:25,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:05:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 20:05:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:05:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 20:05:25,931 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 20:05:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:25,931 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 20:05:25,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 20:05:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:25,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:25,936 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:25,936 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -290387138, now seen corresponding path program 348 times [2020-02-10 20:05:25,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:25,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818373715] [2020-02-10 20:05:25,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:26,467 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:05:26,598 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:26,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:05:26,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818373715] [2020-02-10 20:05:26,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:26,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:26,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401650032] [2020-02-10 20:05:26,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:26,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:26,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:26,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:26,608 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:05:26,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:26,844 INFO L93 Difference]: Finished difference Result 5976 states and 26690 transitions. [2020-02-10 20:05:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:26,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:26,859 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:05:26,859 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:05:26,860 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:05:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3114. [2020-02-10 20:05:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:05:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15541 transitions. [2020-02-10 20:05:27,066 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15541 transitions. Word has length 31 [2020-02-10 20:05:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:27,066 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15541 transitions. [2020-02-10 20:05:27,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15541 transitions. [2020-02-10 20:05:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:27,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:27,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:27,071 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:27,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1470564034, now seen corresponding path program 349 times [2020-02-10 20:05:27,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:27,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138038961] [2020-02-10 20:05:27,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:27,624 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:27,755 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:27,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:05:27,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138038961] [2020-02-10 20:05:27,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:27,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:27,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346922769] [2020-02-10 20:05:27,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:27,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:27,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:27,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:27,765 INFO L87 Difference]: Start difference. First operand 3114 states and 15541 transitions. Second operand 12 states. [2020-02-10 20:05:28,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:28,060 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:05:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:28,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:28,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:28,074 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:05:28,074 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:05:28,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:05:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:05:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:05:28,274 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:05:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:28,274 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:05:28,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:05:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:28,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:28,279 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1134460358, now seen corresponding path program 350 times [2020-02-10 20:05:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295516602] [2020-02-10 20:05:28,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:28,949 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:28,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295516602] [2020-02-10 20:05:28,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:28,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:28,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815120260] [2020-02-10 20:05:28,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:28,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:28,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:28,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:28,960 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:05:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:29,230 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 20:05:29,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:29,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:29,246 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:05:29,246 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 20:05:29,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 20:05:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 20:05:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:05:29,447 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:05:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:29,447 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:05:29,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:05:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:29,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:29,452 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:29,452 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:29,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1894875270, now seen corresponding path program 351 times [2020-02-10 20:05:29,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:29,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118054663] [2020-02-10 20:05:29,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:29,989 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:30,125 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:30,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118054663] [2020-02-10 20:05:30,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:30,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:30,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795829397] [2020-02-10 20:05:30,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:30,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:30,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:30,135 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:05:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:30,393 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 20:05:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:30,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:30,408 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:05:30,409 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:05:30,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:05:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3124. [2020-02-10 20:05:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:05:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15564 transitions. [2020-02-10 20:05:30,609 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15564 transitions. Word has length 31 [2020-02-10 20:05:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:30,609 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15564 transitions. [2020-02-10 20:05:30,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15564 transitions. [2020-02-10 20:05:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:30,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:30,614 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash -134822330, now seen corresponding path program 352 times [2020-02-10 20:05:30,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:30,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658438621] [2020-02-10 20:05:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:31,144 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:05:31,278 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:05:31,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:05:31,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658438621] [2020-02-10 20:05:31,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:31,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:31,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222977504] [2020-02-10 20:05:31,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:31,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:31,289 INFO L87 Difference]: Start difference. First operand 3124 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:05:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:31,645 INFO L93 Difference]: Finished difference Result 5966 states and 26669 transitions. [2020-02-10 20:05:31,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:31,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:31,659 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:05:31,660 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 20:05:31,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 20:05:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3119. [2020-02-10 20:05:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:05:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15550 transitions. [2020-02-10 20:05:31,865 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15550 transitions. Word has length 31 [2020-02-10 20:05:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:31,866 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15550 transitions. [2020-02-10 20:05:31,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:31,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15550 transitions. [2020-02-10 20:05:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:31,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:31,871 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:31,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash -138473350, now seen corresponding path program 353 times [2020-02-10 20:05:31,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:31,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444592920] [2020-02-10 20:05:31,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:32,412 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:32,542 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:32,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444592920] [2020-02-10 20:05:32,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:32,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:32,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114744708] [2020-02-10 20:05:32,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:32,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:32,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:32,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:32,553 INFO L87 Difference]: Start difference. First operand 3119 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:05:32,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:32,803 INFO L93 Difference]: Finished difference Result 5967 states and 26672 transitions. [2020-02-10 20:05:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:32,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:32,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:32,818 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:05:32,819 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:05:32,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:05:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3125. [2020-02-10 20:05:33,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:05:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15561 transitions. [2020-02-10 20:05:33,073 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15561 transitions. Word has length 31 [2020-02-10 20:05:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:33,073 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15561 transitions. [2020-02-10 20:05:33,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15561 transitions. [2020-02-10 20:05:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:33,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:33,079 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:33,079 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -983444802, now seen corresponding path program 354 times [2020-02-10 20:05:33,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:33,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51431136] [2020-02-10 20:05:33,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:33,619 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:33,746 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:33,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51431136] [2020-02-10 20:05:33,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:33,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:33,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306810020] [2020-02-10 20:05:33,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:33,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:33,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:33,756 INFO L87 Difference]: Start difference. First operand 3125 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:05:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:34,120 INFO L93 Difference]: Finished difference Result 5968 states and 26668 transitions. [2020-02-10 20:05:34,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:34,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:34,134 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:05:34,134 INFO L226 Difference]: Without dead ends: 5939 [2020-02-10 20:05:34,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2020-02-10 20:05:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 3114. [2020-02-10 20:05:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:05:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15536 transitions. [2020-02-10 20:05:34,339 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15536 transitions. Word has length 31 [2020-02-10 20:05:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:34,340 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15536 transitions. [2020-02-10 20:05:34,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15536 transitions. [2020-02-10 20:05:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:34,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:34,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:34,345 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1286374146, now seen corresponding path program 355 times [2020-02-10 20:05:34,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:34,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060043482] [2020-02-10 20:05:34,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:34,873 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:35,003 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:35,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060043482] [2020-02-10 20:05:35,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:35,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:35,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836437705] [2020-02-10 20:05:35,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:35,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:35,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:35,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:35,013 INFO L87 Difference]: Start difference. First operand 3114 states and 15536 transitions. Second operand 12 states. [2020-02-10 20:05:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:35,358 INFO L93 Difference]: Finished difference Result 5980 states and 26708 transitions. [2020-02-10 20:05:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:35,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:35,372 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:05:35,373 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:05:35,373 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:05:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3126. [2020-02-10 20:05:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:05:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15570 transitions. [2020-02-10 20:05:35,574 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15570 transitions. Word has length 31 [2020-02-10 20:05:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:35,574 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15570 transitions. [2020-02-10 20:05:35,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15570 transitions. [2020-02-10 20:05:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:35,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:35,579 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:35,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash 441402694, now seen corresponding path program 356 times [2020-02-10 20:05:35,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:35,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132725467] [2020-02-10 20:05:35,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:36,121 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:36,251 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:36,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132725467] [2020-02-10 20:05:36,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:36,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:36,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112006954] [2020-02-10 20:05:36,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:36,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:36,261 INFO L87 Difference]: Start difference. First operand 3126 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:05:36,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:36,522 INFO L93 Difference]: Finished difference Result 5977 states and 26696 transitions. [2020-02-10 20:05:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:36,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:36,536 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:05:36,537 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:05:36,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:05:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3120. [2020-02-10 20:05:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:05:36,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15553 transitions. [2020-02-10 20:05:36,738 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15553 transitions. Word has length 31 [2020-02-10 20:05:36,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:36,738 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15553 transitions. [2020-02-10 20:05:36,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15553 transitions. [2020-02-10 20:05:36,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:36,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:36,743 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:36,743 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:36,743 INFO L82 PathProgramCache]: Analyzing trace with hash 862062910, now seen corresponding path program 357 times [2020-02-10 20:05:36,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:36,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533663628] [2020-02-10 20:05:36,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:37,279 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:37,414 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:37,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533663628] [2020-02-10 20:05:37,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:37,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:37,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722972814] [2020-02-10 20:05:37,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:37,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:37,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:37,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:37,424 INFO L87 Difference]: Start difference. First operand 3120 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:05:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:37,641 INFO L93 Difference]: Finished difference Result 5982 states and 26707 transitions. [2020-02-10 20:05:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:37,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:37,655 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:05:37,655 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:05:37,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:37,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:05:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3127. [2020-02-10 20:05:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15566 transitions. [2020-02-10 20:05:37,854 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15566 transitions. Word has length 31 [2020-02-10 20:05:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:37,854 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15566 transitions. [2020-02-10 20:05:37,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15566 transitions. [2020-02-10 20:05:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:37,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:37,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:37,860 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash -827879994, now seen corresponding path program 358 times [2020-02-10 20:05:37,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:37,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412082484] [2020-02-10 20:05:37,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:38,399 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:38,533 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:38,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412082484] [2020-02-10 20:05:38,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:38,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:38,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934446251] [2020-02-10 20:05:38,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:38,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:38,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:38,544 INFO L87 Difference]: Start difference. First operand 3127 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:05:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:38,777 INFO L93 Difference]: Finished difference Result 5980 states and 26696 transitions. [2020-02-10 20:05:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:38,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:38,792 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:05:38,792 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:05:38,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:05:38,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3120. [2020-02-10 20:05:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:05:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15547 transitions. [2020-02-10 20:05:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15547 transitions. Word has length 31 [2020-02-10 20:05:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:38,993 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15547 transitions. [2020-02-10 20:05:38,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15547 transitions. [2020-02-10 20:05:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:38,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:38,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:38,998 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -407219778, now seen corresponding path program 359 times [2020-02-10 20:05:38,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:38,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528158581] [2020-02-10 20:05:38,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:39,619 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:39,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528158581] [2020-02-10 20:05:39,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:39,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:39,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023519548] [2020-02-10 20:05:39,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:39,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:39,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:39,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:39,631 INFO L87 Difference]: Start difference. First operand 3120 states and 15547 transitions. Second operand 12 states. [2020-02-10 20:05:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:39,847 INFO L93 Difference]: Finished difference Result 5975 states and 26686 transitions. [2020-02-10 20:05:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:39,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:39,862 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 20:05:39,862 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:05:39,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:05:40,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 20:05:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:05:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15558 transitions. [2020-02-10 20:05:40,067 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15558 transitions. Word has length 31 [2020-02-10 20:05:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:40,067 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15558 transitions. [2020-02-10 20:05:40,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15558 transitions. [2020-02-10 20:05:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:40,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:40,073 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:40,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1252191230, now seen corresponding path program 360 times [2020-02-10 20:05:40,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:40,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494414281] [2020-02-10 20:05:40,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:40,627 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:40,758 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:40,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:05:40,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494414281] [2020-02-10 20:05:40,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:40,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:40,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964643808] [2020-02-10 20:05:40,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:40,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:40,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:40,768 INFO L87 Difference]: Start difference. First operand 3126 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:05:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:40,991 INFO L93 Difference]: Finished difference Result 5976 states and 26682 transitions. [2020-02-10 20:05:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:40,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:41,007 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:05:41,007 INFO L226 Difference]: Without dead ends: 5936 [2020-02-10 20:05:41,007 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2020-02-10 20:05:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 3104. [2020-02-10 20:05:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:05:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15513 transitions. [2020-02-10 20:05:41,255 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15513 transitions. Word has length 31 [2020-02-10 20:05:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:41,255 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15513 transitions. [2020-02-10 20:05:41,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15513 transitions. [2020-02-10 20:05:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:41,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:41,261 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1612839400, now seen corresponding path program 361 times [2020-02-10 20:05:41,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:41,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246977332] [2020-02-10 20:05:41,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:41,800 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:41,933 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:41,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:05:41,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246977332] [2020-02-10 20:05:41,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:41,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:41,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500941775] [2020-02-10 20:05:41,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:41,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:41,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:41,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:41,943 INFO L87 Difference]: Start difference. First operand 3104 states and 15513 transitions. Second operand 12 states. [2020-02-10 20:05:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:42,183 INFO L93 Difference]: Finished difference Result 6011 states and 26822 transitions. [2020-02-10 20:05:42,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:42,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:42,198 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:05:42,198 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:05:42,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:05:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 20:05:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15606 transitions. [2020-02-10 20:05:42,403 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15606 transitions. Word has length 31 [2020-02-10 20:05:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:42,403 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15606 transitions. [2020-02-10 20:05:42,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15606 transitions. [2020-02-10 20:05:42,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:42,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:42,409 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:42,409 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1190353674, now seen corresponding path program 362 times [2020-02-10 20:05:42,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:42,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262297564] [2020-02-10 20:05:42,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:42,941 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:05:43,071 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:43,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262297564] [2020-02-10 20:05:43,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:43,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286798480] [2020-02-10 20:05:43,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:43,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:43,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:43,080 INFO L87 Difference]: Start difference. First operand 3127 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:05:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:43,308 INFO L93 Difference]: Finished difference Result 6008 states and 26811 transitions. [2020-02-10 20:05:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:43,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:43,323 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:05:43,323 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:05:43,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:05:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 20:05:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:05:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15592 transitions. [2020-02-10 20:05:43,533 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15592 transitions. Word has length 31 [2020-02-10 20:05:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:43,533 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15592 transitions. [2020-02-10 20:05:43,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:43,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15592 transitions. [2020-02-10 20:05:43,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:43,538 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:43,539 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:43,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1188528164, now seen corresponding path program 363 times [2020-02-10 20:05:43,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:43,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244783665] [2020-02-10 20:05:43,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:44,079 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:44,203 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:44,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244783665] [2020-02-10 20:05:44,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:44,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:44,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895019898] [2020-02-10 20:05:44,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:44,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:44,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:44,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:44,214 INFO L87 Difference]: Start difference. First operand 3122 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:05:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:44,459 INFO L93 Difference]: Finished difference Result 6018 states and 26834 transitions. [2020-02-10 20:05:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:44,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:44,474 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:05:44,474 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:05:44,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:05:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3130. [2020-02-10 20:05:44,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:05:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 20:05:44,673 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 20:05:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:44,673 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 20:05:44,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 20:05:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:44,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:44,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:44,678 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash -78929014, now seen corresponding path program 364 times [2020-02-10 20:05:44,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:44,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289760547] [2020-02-10 20:05:44,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:45,201 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:45,333 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:45,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289760547] [2020-02-10 20:05:45,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:45,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:45,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428586125] [2020-02-10 20:05:45,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:45,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:45,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:45,342 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:05:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:45,571 INFO L93 Difference]: Finished difference Result 6019 states and 26828 transitions. [2020-02-10 20:05:45,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:45,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:45,586 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:05:45,586 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:05:45,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:05:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3122. [2020-02-10 20:05:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:05:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 20:05:45,786 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 20:05:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:45,786 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 20:05:45,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 20:05:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:45,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:45,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:45,792 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:45,792 INFO L82 PathProgramCache]: Analyzing trace with hash 553886820, now seen corresponding path program 365 times [2020-02-10 20:05:45,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:45,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309336506] [2020-02-10 20:05:45,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:46,325 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:46,457 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:46,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:05:46,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309336506] [2020-02-10 20:05:46,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:46,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:46,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738188475] [2020-02-10 20:05:46,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:46,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:46,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:46,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:46,467 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:05:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:46,691 INFO L93 Difference]: Finished difference Result 6009 states and 26808 transitions. [2020-02-10 20:05:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:46,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:46,706 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 20:05:46,706 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:05:46,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:05:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3127. [2020-02-10 20:05:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15596 transitions. [2020-02-10 20:05:46,905 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15596 transitions. Word has length 31 [2020-02-10 20:05:46,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:46,906 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15596 transitions. [2020-02-10 20:05:46,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:46,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15596 transitions. [2020-02-10 20:05:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:46,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:46,911 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash -291084632, now seen corresponding path program 366 times [2020-02-10 20:05:46,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:46,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340248009] [2020-02-10 20:05:46,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:47,428 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:05:47,553 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:05:47,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:05:47,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340248009] [2020-02-10 20:05:47,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:47,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:47,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629204782] [2020-02-10 20:05:47,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:47,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:47,562 INFO L87 Difference]: Start difference. First operand 3127 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:05:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:47,860 INFO L93 Difference]: Finished difference Result 6013 states and 26811 transitions. [2020-02-10 20:05:47,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:47,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:47,875 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 20:05:47,875 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:05:47,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:05:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3117. [2020-02-10 20:05:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:05:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15573 transitions. [2020-02-10 20:05:48,079 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15573 transitions. Word has length 31 [2020-02-10 20:05:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:48,079 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15573 transitions. [2020-02-10 20:05:48,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15573 transitions. [2020-02-10 20:05:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:48,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:48,084 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1344092972, now seen corresponding path program 367 times [2020-02-10 20:05:48,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:48,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091741049] [2020-02-10 20:05:48,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:48,617 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:05:48,747 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:48,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:05:48,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091741049] [2020-02-10 20:05:48,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:48,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:48,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304022773] [2020-02-10 20:05:48,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:48,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:48,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:48,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:48,757 INFO L87 Difference]: Start difference. First operand 3117 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:05:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:48,985 INFO L93 Difference]: Finished difference Result 6006 states and 26805 transitions. [2020-02-10 20:05:48,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:48,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:49,000 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:05:49,000 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:05:49,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:05:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3127. [2020-02-10 20:05:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 20:05:49,247 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 20:05:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:49,247 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 20:05:49,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 20:05:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:49,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:49,253 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:49,253 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:49,253 INFO L82 PathProgramCache]: Analyzing trace with hash 921607246, now seen corresponding path program 368 times [2020-02-10 20:05:49,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:49,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129599462] [2020-02-10 20:05:49,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:49,776 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:05:49,905 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:49,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:05:49,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129599462] [2020-02-10 20:05:49,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:49,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:49,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799006607] [2020-02-10 20:05:49,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:49,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:49,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:49,914 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:05:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:50,146 INFO L93 Difference]: Finished difference Result 6003 states and 26794 transitions. [2020-02-10 20:05:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:50,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:50,162 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:05:50,163 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:05:50,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:05:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:05:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:05:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 20:05:50,370 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 20:05:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:50,370 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 20:05:50,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 20:05:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:50,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:50,375 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash 495470500, now seen corresponding path program 369 times [2020-02-10 20:05:50,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:50,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172954542] [2020-02-10 20:05:50,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:50,916 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:51,048 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:51,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:05:51,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172954542] [2020-02-10 20:05:51,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:51,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:51,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331029417] [2020-02-10 20:05:51,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:51,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:51,057 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:05:51,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:51,293 INFO L93 Difference]: Finished difference Result 6008 states and 26805 transitions. [2020-02-10 20:05:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:51,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:51,308 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:05:51,308 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:05:51,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:05:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3128. [2020-02-10 20:05:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:05:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:05:51,509 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:05:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:51,509 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:05:51,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:05:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:51,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:51,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:51,514 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1616958130, now seen corresponding path program 370 times [2020-02-10 20:05:51,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:51,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446540390] [2020-02-10 20:05:51,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:52,050 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:52,175 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:52,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:05:52,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446540390] [2020-02-10 20:05:52,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:52,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:52,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322461582] [2020-02-10 20:05:52,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:52,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:52,185 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:05:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:52,437 INFO L93 Difference]: Finished difference Result 6006 states and 26795 transitions. [2020-02-10 20:05:52,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:52,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:52,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:52,452 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:05:52,453 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:05:52,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:05:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 20:05:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:05:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 20:05:52,652 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 20:05:52,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:52,652 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 20:05:52,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 20:05:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:52,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:52,657 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:52,657 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash -139170844, now seen corresponding path program 371 times [2020-02-10 20:05:52,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:52,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898246544] [2020-02-10 20:05:52,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:53,192 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:05:53,324 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:53,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898246544] [2020-02-10 20:05:53,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:53,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:53,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503264291] [2020-02-10 20:05:53,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:53,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:53,335 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:05:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:53,557 INFO L93 Difference]: Finished difference Result 6001 states and 26785 transitions. [2020-02-10 20:05:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:53,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:53,572 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:05:53,573 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 20:05:53,573 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 20:05:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3127. [2020-02-10 20:05:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:05:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 20:05:53,780 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 20:05:53,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:53,781 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 20:05:53,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 20:05:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:53,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:53,786 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1829113748, now seen corresponding path program 372 times [2020-02-10 20:05:53,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:53,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124296199] [2020-02-10 20:05:53,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:54,316 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:54,448 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:54,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124296199] [2020-02-10 20:05:54,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:54,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:54,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956451056] [2020-02-10 20:05:54,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:54,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:54,458 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:05:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:54,688 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 20:05:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:54,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:54,703 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:05:54,703 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:05:54,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:05:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3117. [2020-02-10 20:05:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:05:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15568 transitions. [2020-02-10 20:05:54,907 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15568 transitions. Word has length 31 [2020-02-10 20:05:54,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:54,907 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15568 transitions. [2020-02-10 20:05:54,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15568 transitions. [2020-02-10 20:05:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:54,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:54,912 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:54,912 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:54,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash 651035308, now seen corresponding path program 373 times [2020-02-10 20:05:54,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:54,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920070249] [2020-02-10 20:05:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:55,446 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:55,572 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:55,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:05:55,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920070249] [2020-02-10 20:05:55,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:55,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:55,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301388292] [2020-02-10 20:05:55,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:55,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:55,583 INFO L87 Difference]: Start difference. First operand 3117 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:05:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:55,898 INFO L93 Difference]: Finished difference Result 6022 states and 26841 transitions. [2020-02-10 20:05:55,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:55,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:55,913 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:05:55,913 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:05:55,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:05:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3131. [2020-02-10 20:05:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:05:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15606 transitions. [2020-02-10 20:05:56,118 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15606 transitions. Word has length 31 [2020-02-10 20:05:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:56,118 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15606 transitions. [2020-02-10 20:05:56,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15606 transitions. [2020-02-10 20:05:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:56,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:56,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:56,124 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash -616421870, now seen corresponding path program 374 times [2020-02-10 20:05:56,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:56,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993254837] [2020-02-10 20:05:56,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:56,675 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:05:56,801 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:05:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:56,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993254837] [2020-02-10 20:05:56,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:56,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:56,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116514262] [2020-02-10 20:05:56,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:56,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:56,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:56,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:56,811 INFO L87 Difference]: Start difference. First operand 3131 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:05:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:57,050 INFO L93 Difference]: Finished difference Result 6023 states and 26835 transitions. [2020-02-10 20:05:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:57,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:57,066 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:05:57,066 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:05:57,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:05:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3123. [2020-02-10 20:05:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:05:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 20:05:57,326 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 20:05:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:57,326 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 20:05:57,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 20:05:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:57,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:57,333 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 226724072, now seen corresponding path program 375 times [2020-02-10 20:05:57,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:57,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132010451] [2020-02-10 20:05:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:57,874 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:58,006 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:05:58,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132010451] [2020-02-10 20:05:58,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:58,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:58,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491773371] [2020-02-10 20:05:58,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:58,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:58,018 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:05:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:58,266 INFO L93 Difference]: Finished difference Result 6017 states and 26823 transitions. [2020-02-10 20:05:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:58,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:58,281 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:05:58,281 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:05:58,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:05:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:05:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:05:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15596 transitions. [2020-02-10 20:05:58,489 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15596 transitions. Word has length 31 [2020-02-10 20:05:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:58,489 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15596 transitions. [2020-02-10 20:05:58,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15596 transitions. [2020-02-10 20:05:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:58,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:58,495 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:58,495 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1885704558, now seen corresponding path program 376 times [2020-02-10 20:05:58,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:58,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362636379] [2020-02-10 20:05:58,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:05:59,036 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:05:59,170 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:05:59,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:05:59,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362636379] [2020-02-10 20:05:59,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:05:59,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:05:59,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876587273] [2020-02-10 20:05:59,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:05:59,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:05:59,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:05:59,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:05:59,181 INFO L87 Difference]: Start difference. First operand 3129 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:05:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:05:59,423 INFO L93 Difference]: Finished difference Result 6015 states and 26813 transitions. [2020-02-10 20:05:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:05:59,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:05:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:05:59,438 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:05:59,438 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:05:59,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:05:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:05:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:05:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:05:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 20:05:59,646 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 20:05:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:05:59,646 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 20:05:59,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:05:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 20:05:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:05:59,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:05:59,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:05:59,651 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:05:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:05:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1677199960, now seen corresponding path program 377 times [2020-02-10 20:05:59,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:05:59,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009047374] [2020-02-10 20:05:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:05:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:00,173 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:00,304 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:00,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:06:00,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009047374] [2020-02-10 20:06:00,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:00,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:00,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604280275] [2020-02-10 20:06:00,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:00,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:00,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:00,315 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:06:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:00,555 INFO L93 Difference]: Finished difference Result 6019 states and 26821 transitions. [2020-02-10 20:06:00,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:00,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:00,570 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:06:00,571 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:06:00,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:06:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3129. [2020-02-10 20:06:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:06:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15590 transitions. [2020-02-10 20:06:00,775 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15590 transitions. Word has length 31 [2020-02-10 20:06:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:00,775 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15590 transitions. [2020-02-10 20:06:00,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15590 transitions. [2020-02-10 20:06:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:00,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:00,780 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:00,781 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1772795884, now seen corresponding path program 378 times [2020-02-10 20:06:00,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:00,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893251270] [2020-02-10 20:06:00,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:01,324 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:01,455 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:01,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893251270] [2020-02-10 20:06:01,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:01,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:01,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567862577] [2020-02-10 20:06:01,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:01,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:01,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:01,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:01,466 INFO L87 Difference]: Start difference. First operand 3129 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:06:01,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:01,783 INFO L93 Difference]: Finished difference Result 6016 states and 26809 transitions. [2020-02-10 20:06:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:01,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:01,799 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:06:01,799 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:06:01,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:06:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3117. [2020-02-10 20:06:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:06:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15563 transitions. [2020-02-10 20:06:02,005 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15563 transitions. Word has length 31 [2020-02-10 20:06:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:02,005 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15563 transitions. [2020-02-10 20:06:02,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15563 transitions. [2020-02-10 20:06:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:02,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:02,011 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2029504398, now seen corresponding path program 379 times [2020-02-10 20:06:02,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:02,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939868313] [2020-02-10 20:06:02,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:02,539 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:02,668 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:02,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939868313] [2020-02-10 20:06:02,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:02,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:02,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145146532] [2020-02-10 20:06:02,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:02,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:02,679 INFO L87 Difference]: Start difference. First operand 3117 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:06:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:02,912 INFO L93 Difference]: Finished difference Result 6005 states and 26793 transitions. [2020-02-10 20:06:02,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:02,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:02,927 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:06:02,927 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:06:02,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:06:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 20:06:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:06:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 20:06:03,131 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 20:06:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:03,131 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 20:06:03,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 20:06:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:03,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:03,136 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1184532946, now seen corresponding path program 380 times [2020-02-10 20:06:03,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:03,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95920316] [2020-02-10 20:06:03,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:03,664 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:03,793 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:03,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95920316] [2020-02-10 20:06:03,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:03,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:03,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365887838] [2020-02-10 20:06:03,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:03,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:03,803 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:06:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:04,024 INFO L93 Difference]: Finished difference Result 6009 states and 26796 transitions. [2020-02-10 20:06:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:04,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:04,039 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 20:06:04,039 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:06:04,039 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:06:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 20:06:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:06:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15577 transitions. [2020-02-10 20:06:04,246 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15577 transitions. Word has length 31 [2020-02-10 20:06:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:04,246 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15577 transitions. [2020-02-10 20:06:04,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15577 transitions. [2020-02-10 20:06:04,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:04,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:04,251 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:04,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:04,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1605193162, now seen corresponding path program 381 times [2020-02-10 20:06:04,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:04,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919446113] [2020-02-10 20:06:04,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:04,794 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:04,925 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:04,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919446113] [2020-02-10 20:06:04,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:04,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:04,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821977549] [2020-02-10 20:06:04,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:04,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:04,936 INFO L87 Difference]: Start difference. First operand 3122 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:06:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:05,201 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 20:06:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:05,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:05,217 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:06:05,217 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 20:06:05,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 20:06:05,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3127. [2020-02-10 20:06:05,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:06:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15586 transitions. [2020-02-10 20:06:05,488 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15586 transitions. Word has length 31 [2020-02-10 20:06:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:05,488 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15586 transitions. [2020-02-10 20:06:05,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15586 transitions. [2020-02-10 20:06:05,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:05,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:05,494 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:05,494 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:05,494 INFO L82 PathProgramCache]: Analyzing trace with hash -84749742, now seen corresponding path program 382 times [2020-02-10 20:06:05,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:05,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494965448] [2020-02-10 20:06:05,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:06,037 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:06,169 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:06,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494965448] [2020-02-10 20:06:06,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:06,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:06,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147084781] [2020-02-10 20:06:06,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:06,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:06,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:06,179 INFO L87 Difference]: Start difference. First operand 3127 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:06:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:06,431 INFO L93 Difference]: Finished difference Result 6003 states and 26779 transitions. [2020-02-10 20:06:06,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:06,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:06,445 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:06:06,445 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:06:06,445 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:06:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3122. [2020-02-10 20:06:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:06:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15572 transitions. [2020-02-10 20:06:06,645 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15572 transitions. Word has length 31 [2020-02-10 20:06:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:06,646 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15572 transitions. [2020-02-10 20:06:06,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15572 transitions. [2020-02-10 20:06:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:06,651 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:06,651 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:06,651 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash 335910474, now seen corresponding path program 383 times [2020-02-10 20:06:06,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:06,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433968195] [2020-02-10 20:06:06,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:07,186 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:07,312 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:07,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:06:07,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433968195] [2020-02-10 20:06:07,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:07,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:07,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23842561] [2020-02-10 20:06:07,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:07,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:07,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:07,321 INFO L87 Difference]: Start difference. First operand 3122 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:06:07,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:07,555 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 20:06:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:07,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:07,569 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:06:07,570 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:06:07,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:06:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3128. [2020-02-10 20:06:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:06:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:06:07,774 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:06:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:07,774 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:06:07,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:06:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:07,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:07,779 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:07,779 INFO L82 PathProgramCache]: Analyzing trace with hash -509060978, now seen corresponding path program 384 times [2020-02-10 20:06:07,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:07,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384362630] [2020-02-10 20:06:07,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:08,446 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:08,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384362630] [2020-02-10 20:06:08,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:08,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:08,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200751822] [2020-02-10 20:06:08,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:08,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:08,457 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:06:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:08,759 INFO L93 Difference]: Finished difference Result 6008 states and 26784 transitions. [2020-02-10 20:06:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:08,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:08,774 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:06:08,774 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:06:08,774 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:06:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3112. [2020-02-10 20:06:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:06:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15549 transitions. [2020-02-10 20:06:08,981 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15549 transitions. Word has length 31 [2020-02-10 20:06:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:08,981 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15549 transitions. [2020-02-10 20:06:08,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15549 transitions. [2020-02-10 20:06:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:08,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:08,987 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash 112344062, now seen corresponding path program 385 times [2020-02-10 20:06:08,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:08,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919555865] [2020-02-10 20:06:08,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:09,650 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:09,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:06:09,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919555865] [2020-02-10 20:06:09,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:09,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:09,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298555545] [2020-02-10 20:06:09,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:09,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:09,660 INFO L87 Difference]: Start difference. First operand 3112 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:06:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:09,952 INFO L93 Difference]: Finished difference Result 6036 states and 26879 transitions. [2020-02-10 20:06:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:09,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:09,967 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:06:09,968 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:06:09,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:06:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 20:06:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:06:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15610 transitions. [2020-02-10 20:06:10,168 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15610 transitions. Word has length 31 [2020-02-10 20:06:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:10,168 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15610 transitions. [2020-02-10 20:06:10,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15610 transitions. [2020-02-10 20:06:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:10,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:10,173 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:10,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:10,173 INFO L82 PathProgramCache]: Analyzing trace with hash -310141664, now seen corresponding path program 386 times [2020-02-10 20:06:10,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:10,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907115317] [2020-02-10 20:06:10,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:10,720 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:06:10,850 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:10,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:06:10,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907115317] [2020-02-10 20:06:10,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:10,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:10,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201605771] [2020-02-10 20:06:10,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:10,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:10,860 INFO L87 Difference]: Start difference. First operand 3130 states and 15610 transitions. Second operand 12 states. [2020-02-10 20:06:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:11,105 INFO L93 Difference]: Finished difference Result 6033 states and 26868 transitions. [2020-02-10 20:06:11,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:11,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:11,119 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:06:11,120 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:06:11,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:06:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 20:06:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:06:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15596 transitions. [2020-02-10 20:06:11,321 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15596 transitions. Word has length 31 [2020-02-10 20:06:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:11,321 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15596 transitions. [2020-02-10 20:06:11,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:11,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15596 transitions. [2020-02-10 20:06:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:11,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:11,327 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:11,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -311967174, now seen corresponding path program 387 times [2020-02-10 20:06:11,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:11,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990070248] [2020-02-10 20:06:11,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:11,873 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:12,004 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:12,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990070248] [2020-02-10 20:06:12,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:12,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:12,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498829897] [2020-02-10 20:06:12,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:12,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:12,014 INFO L87 Difference]: Start difference. First operand 3125 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:06:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:12,336 INFO L93 Difference]: Finished difference Result 6043 states and 26891 transitions. [2020-02-10 20:06:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:12,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:12,351 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:06:12,351 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:06:12,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:06:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3133. [2020-02-10 20:06:12,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:06:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15611 transitions. [2020-02-10 20:06:12,557 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15611 transitions. Word has length 31 [2020-02-10 20:06:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:12,557 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15611 transitions. [2020-02-10 20:06:12,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15611 transitions. [2020-02-10 20:06:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:12,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:12,562 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1579424352, now seen corresponding path program 388 times [2020-02-10 20:06:12,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:12,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548143267] [2020-02-10 20:06:12,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:13,115 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:13,244 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:13,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548143267] [2020-02-10 20:06:13,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:13,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:13,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893962123] [2020-02-10 20:06:13,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:13,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:13,254 INFO L87 Difference]: Start difference. First operand 3133 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:06:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:13,511 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 20:06:13,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:13,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:13,526 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:06:13,526 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:06:13,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:06:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 20:06:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:06:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:06:13,792 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:06:13,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:13,792 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:06:13,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:06:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:13,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:13,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:13,798 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -946608518, now seen corresponding path program 389 times [2020-02-10 20:06:13,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:13,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488755590] [2020-02-10 20:06:13,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:14,317 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:14,448 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:14,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488755590] [2020-02-10 20:06:14,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:14,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:14,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356010637] [2020-02-10 20:06:14,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:14,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:14,457 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:06:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:14,697 INFO L93 Difference]: Finished difference Result 6034 states and 26865 transitions. [2020-02-10 20:06:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:14,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:14,712 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:06:14,712 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:06:14,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:06:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 20:06:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:06:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15600 transitions. [2020-02-10 20:06:14,916 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15600 transitions. Word has length 31 [2020-02-10 20:06:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:14,916 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15600 transitions. [2020-02-10 20:06:14,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15600 transitions. [2020-02-10 20:06:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:14,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:14,921 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1791579970, now seen corresponding path program 390 times [2020-02-10 20:06:14,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:14,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798734683] [2020-02-10 20:06:14,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:15,450 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:15,576 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:15,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798734683] [2020-02-10 20:06:15,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:15,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:15,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764273533] [2020-02-10 20:06:15,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:15,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:15,586 INFO L87 Difference]: Start difference. First operand 3130 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:06:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:15,891 INFO L93 Difference]: Finished difference Result 6038 states and 26868 transitions. [2020-02-10 20:06:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:15,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:15,906 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:06:15,906 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:06:15,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:06:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3120. [2020-02-10 20:06:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:06:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 20:06:16,107 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 20:06:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:16,107 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 20:06:16,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 20:06:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:16,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:16,112 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1319215212, now seen corresponding path program 391 times [2020-02-10 20:06:16,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:16,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375696303] [2020-02-10 20:06:16,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:16,652 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:16,781 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:16,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375696303] [2020-02-10 20:06:16,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:16,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:16,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101564249] [2020-02-10 20:06:16,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:16,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:16,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:16,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:16,790 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:06:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:17,093 INFO L93 Difference]: Finished difference Result 6041 states and 26884 transitions. [2020-02-10 20:06:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:17,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:17,108 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:06:17,108 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:06:17,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:17,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:06:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 20:06:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:06:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15608 transitions. [2020-02-10 20:06:17,307 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15608 transitions. Word has length 31 [2020-02-10 20:06:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:17,308 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15608 transitions. [2020-02-10 20:06:17,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15608 transitions. [2020-02-10 20:06:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:17,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:17,313 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:17,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:17,313 INFO L82 PathProgramCache]: Analyzing trace with hash 896729486, now seen corresponding path program 392 times [2020-02-10 20:06:17,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:17,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407388108] [2020-02-10 20:06:17,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:17,845 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:17,977 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:17,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:06:17,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407388108] [2020-02-10 20:06:17,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:17,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:17,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832331765] [2020-02-10 20:06:17,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:17,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:17,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:17,987 INFO L87 Difference]: Start difference. First operand 3131 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:06:18,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:18,269 INFO L93 Difference]: Finished difference Result 6038 states and 26873 transitions. [2020-02-10 20:06:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:18,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:18,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:18,285 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:06:18,285 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:06:18,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:06:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3126. [2020-02-10 20:06:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:06:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15594 transitions. [2020-02-10 20:06:18,492 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15594 transitions. Word has length 31 [2020-02-10 20:06:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:18,492 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15594 transitions. [2020-02-10 20:06:18,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15594 transitions. [2020-02-10 20:06:18,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:18,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:18,497 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash -590185350, now seen corresponding path program 393 times [2020-02-10 20:06:18,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:18,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456388693] [2020-02-10 20:06:18,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:19,044 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:19,172 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:19,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:06:19,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456388693] [2020-02-10 20:06:19,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:19,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:19,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077607690] [2020-02-10 20:06:19,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:19,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:19,182 INFO L87 Difference]: Start difference. First operand 3126 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:06:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:19,459 INFO L93 Difference]: Finished difference Result 6051 states and 26901 transitions. [2020-02-10 20:06:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:19,460 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:19,474 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:06:19,474 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:06:19,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:19,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:06:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3135. [2020-02-10 20:06:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:06:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 20:06:19,674 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 20:06:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:19,675 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 20:06:19,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 20:06:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:19,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:19,680 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:19,680 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:19,680 INFO L82 PathProgramCache]: Analyzing trace with hash -520075314, now seen corresponding path program 394 times [2020-02-10 20:06:19,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:19,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062074649] [2020-02-10 20:06:19,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:20,229 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:20,358 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:20,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062074649] [2020-02-10 20:06:20,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:20,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:20,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097039297] [2020-02-10 20:06:20,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:20,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:20,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:20,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:20,369 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:06:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:20,642 INFO L93 Difference]: Finished difference Result 6054 states and 26898 transitions. [2020-02-10 20:06:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:20,642 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:20,658 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:06:20,658 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:06:20,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:06:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3126. [2020-02-10 20:06:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:06:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:06:20,859 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:06:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:20,860 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:06:20,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:06:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:20,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:20,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:20,865 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1224826694, now seen corresponding path program 395 times [2020-02-10 20:06:20,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:20,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519765028] [2020-02-10 20:06:20,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:21,401 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:21,532 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:21,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:06:21,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519765028] [2020-02-10 20:06:21,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:21,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:21,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370478888] [2020-02-10 20:06:21,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:21,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:21,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:21,543 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:06:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:21,906 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 20:06:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:21,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:21,921 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:06:21,921 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:06:21,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:06:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3132. [2020-02-10 20:06:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:06:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15599 transitions. [2020-02-10 20:06:22,179 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15599 transitions. Word has length 31 [2020-02-10 20:06:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:22,179 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15599 transitions. [2020-02-10 20:06:22,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15599 transitions. [2020-02-10 20:06:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:22,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:22,184 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:22,184 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -732230932, now seen corresponding path program 396 times [2020-02-10 20:06:22,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:22,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666245739] [2020-02-10 20:06:22,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:22,714 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:22,848 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:22,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:06:22,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666245739] [2020-02-10 20:06:22,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:22,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:22,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538315659] [2020-02-10 20:06:22,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:22,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:22,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:22,857 INFO L87 Difference]: Start difference. First operand 3132 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:06:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:23,178 INFO L93 Difference]: Finished difference Result 6048 states and 26880 transitions. [2020-02-10 20:06:23,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:23,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:23,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:23,193 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:06:23,193 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:06:23,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:06:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3120. [2020-02-10 20:06:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:06:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15571 transitions. [2020-02-10 20:06:23,392 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15571 transitions. Word has length 31 [2020-02-10 20:06:23,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:23,392 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15571 transitions. [2020-02-10 20:06:23,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15571 transitions. [2020-02-10 20:06:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:23,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:23,397 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:23,397 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:23,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:23,398 INFO L82 PathProgramCache]: Analyzing trace with hash 626157548, now seen corresponding path program 397 times [2020-02-10 20:06:23,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:23,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518387570] [2020-02-10 20:06:23,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:23,952 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:24,087 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:06:24,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:06:24,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518387570] [2020-02-10 20:06:24,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:24,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:24,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294126591] [2020-02-10 20:06:24,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:24,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:24,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:24,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:24,098 INFO L87 Difference]: Start difference. First operand 3120 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:06:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:24,391 INFO L93 Difference]: Finished difference Result 6065 states and 26940 transitions. [2020-02-10 20:06:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:24,392 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:24,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:24,405 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:06:24,405 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:06:24,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:06:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3139. [2020-02-10 20:06:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:06:24,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15623 transitions. [2020-02-10 20:06:24,613 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15623 transitions. Word has length 31 [2020-02-10 20:06:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:24,613 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15623 transitions. [2020-02-10 20:06:24,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15623 transitions. [2020-02-10 20:06:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:24,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:24,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:24,619 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:24,619 INFO L82 PathProgramCache]: Analyzing trace with hash -641299630, now seen corresponding path program 398 times [2020-02-10 20:06:24,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:24,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804295499] [2020-02-10 20:06:24,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:25,170 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:25,299 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:25,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:06:25,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804295499] [2020-02-10 20:06:25,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:25,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:25,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581904489] [2020-02-10 20:06:25,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:25,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:25,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:25,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:25,309 INFO L87 Difference]: Start difference. First operand 3139 states and 15623 transitions. Second operand 12 states. [2020-02-10 20:06:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:25,675 INFO L93 Difference]: Finished difference Result 6066 states and 26934 transitions. [2020-02-10 20:06:25,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:25,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:25,689 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:06:25,689 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:06:25,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:06:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3131. [2020-02-10 20:06:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:06:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15600 transitions. [2020-02-10 20:06:25,888 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15600 transitions. Word has length 31 [2020-02-10 20:06:25,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:25,888 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15600 transitions. [2020-02-10 20:06:25,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15600 transitions. [2020-02-10 20:06:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:25,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:25,893 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:25,893 INFO L82 PathProgramCache]: Analyzing trace with hash -858931778, now seen corresponding path program 399 times [2020-02-10 20:06:25,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:25,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988049336] [2020-02-10 20:06:25,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:26,452 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:26,580 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:26,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988049336] [2020-02-10 20:06:26,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:26,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:26,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006388120] [2020-02-10 20:06:26,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:26,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:26,590 INFO L87 Difference]: Start difference. First operand 3131 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:06:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:26,878 INFO L93 Difference]: Finished difference Result 6068 states and 26937 transitions. [2020-02-10 20:06:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:26,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:26,894 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:06:26,894 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:06:26,894 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:06:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3140. [2020-02-10 20:06:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:06:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15617 transitions. [2020-02-10 20:06:27,099 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15617 transitions. Word has length 31 [2020-02-10 20:06:27,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:27,099 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15617 transitions. [2020-02-10 20:06:27,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15617 transitions. [2020-02-10 20:06:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:27,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:27,104 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -788821742, now seen corresponding path program 400 times [2020-02-10 20:06:27,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:27,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143581365] [2020-02-10 20:06:27,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:27,669 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:27,800 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:27,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143581365] [2020-02-10 20:06:27,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:27,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:27,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29221626] [2020-02-10 20:06:27,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:27,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:27,810 INFO L87 Difference]: Start difference. First operand 3140 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:06:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:27,994 INFO L93 Difference]: Finished difference Result 6071 states and 26934 transitions. [2020-02-10 20:06:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:27,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:28,009 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:06:28,010 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:06:28,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:06:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3131. [2020-02-10 20:06:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:06:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 20:06:28,210 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 20:06:28,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:28,210 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 20:06:28,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:28,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 20:06:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:28,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:28,216 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:28,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1532111486, now seen corresponding path program 401 times [2020-02-10 20:06:28,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:28,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90831630] [2020-02-10 20:06:28,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:28,778 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:28,910 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:28,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90831630] [2020-02-10 20:06:28,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:28,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:28,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378335988] [2020-02-10 20:06:28,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:28,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:28,920 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:06:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:29,146 INFO L93 Difference]: Finished difference Result 6072 states and 26936 transitions. [2020-02-10 20:06:29,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:29,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:29,161 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:06:29,161 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 20:06:29,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 20:06:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3142. [2020-02-10 20:06:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:06:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15611 transitions. [2020-02-10 20:06:29,362 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15611 transitions. Word has length 31 [2020-02-10 20:06:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:29,362 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15611 transitions. [2020-02-10 20:06:29,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15611 transitions. [2020-02-10 20:06:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:29,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:29,367 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:29,368 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1425288596, now seen corresponding path program 402 times [2020-02-10 20:06:29,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:29,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577884196] [2020-02-10 20:06:29,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:29,967 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:06:30,100 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:06:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:30,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577884196] [2020-02-10 20:06:30,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:30,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:30,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449394091] [2020-02-10 20:06:30,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:30,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:30,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:30,110 INFO L87 Difference]: Start difference. First operand 3142 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:06:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:30,299 INFO L93 Difference]: Finished difference Result 6074 states and 26930 transitions. [2020-02-10 20:06:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:30,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:30,314 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:06:30,314 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:06:30,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:30,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:06:30,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3120. [2020-02-10 20:06:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:06:30,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15563 transitions. [2020-02-10 20:06:30,518 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15563 transitions. Word has length 31 [2020-02-10 20:06:30,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:30,518 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15563 transitions. [2020-02-10 20:06:30,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:30,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15563 transitions. [2020-02-10 20:06:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:30,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:30,570 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2004626638, now seen corresponding path program 403 times [2020-02-10 20:06:30,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:30,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448692870] [2020-02-10 20:06:30,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:31,224 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:31,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:06:31,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448692870] [2020-02-10 20:06:31,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:31,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:31,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502196967] [2020-02-10 20:06:31,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:31,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:31,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:31,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:31,233 INFO L87 Difference]: Start difference. First operand 3120 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:06:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:31,493 INFO L93 Difference]: Finished difference Result 6043 states and 26874 transitions. [2020-02-10 20:06:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:31,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:31,508 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:06:31,508 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:06:31,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:06:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3132. [2020-02-10 20:06:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:06:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 20:06:31,709 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 20:06:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:31,709 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 20:06:31,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 20:06:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:31,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:31,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:31,715 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1159655186, now seen corresponding path program 404 times [2020-02-10 20:06:31,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:31,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077608165] [2020-02-10 20:06:31,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:32,245 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:32,377 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:32,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:06:32,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077608165] [2020-02-10 20:06:32,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:32,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:32,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534574209] [2020-02-10 20:06:32,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:32,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:32,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:32,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:32,386 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:06:32,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:32,634 INFO L93 Difference]: Finished difference Result 6047 states and 26877 transitions. [2020-02-10 20:06:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:32,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:32,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:32,650 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 20:06:32,650 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:06:32,650 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:06:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 20:06:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:06:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 20:06:32,857 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 20:06:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:32,857 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 20:06:32,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 20:06:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:32,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:32,862 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:32,862 INFO L82 PathProgramCache]: Analyzing trace with hash 519537312, now seen corresponding path program 405 times [2020-02-10 20:06:32,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:32,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388975881] [2020-02-10 20:06:32,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:33,387 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:33,515 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:06:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:33,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388975881] [2020-02-10 20:06:33,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:33,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104956418] [2020-02-10 20:06:33,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:33,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:33,525 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:06:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:33,754 INFO L93 Difference]: Finished difference Result 6046 states and 26874 transitions. [2020-02-10 20:06:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:33,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:33,770 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:06:33,771 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:06:33,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:06:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3133. [2020-02-10 20:06:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:06:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15593 transitions. [2020-02-10 20:06:33,980 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15593 transitions. Word has length 31 [2020-02-10 20:06:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:33,980 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15593 transitions. [2020-02-10 20:06:33,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15593 transitions. [2020-02-10 20:06:33,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:33,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:33,986 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1012133074, now seen corresponding path program 406 times [2020-02-10 20:06:33,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:33,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775248697] [2020-02-10 20:06:33,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:34,524 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:06:34,654 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:06:34,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:06:34,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775248697] [2020-02-10 20:06:34,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:34,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:34,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405803431] [2020-02-10 20:06:34,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:34,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:34,664 INFO L87 Difference]: Start difference. First operand 3133 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:06:34,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:34,899 INFO L93 Difference]: Finished difference Result 6052 states and 26880 transitions. [2020-02-10 20:06:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:34,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:34,913 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:06:34,913 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:06:34,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:35,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:06:35,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3127. [2020-02-10 20:06:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:06:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 20:06:35,115 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 20:06:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:35,115 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 20:06:35,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 20:06:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:35,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:35,120 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:35,120 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:35,120 INFO L82 PathProgramCache]: Analyzing trace with hash -749745376, now seen corresponding path program 407 times [2020-02-10 20:06:35,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:35,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317025687] [2020-02-10 20:06:35,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:35,666 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:06:35,794 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:06:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317025687] [2020-02-10 20:06:35,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736558380] [2020-02-10 20:06:35,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:35,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:35,804 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:06:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:36,093 INFO L93 Difference]: Finished difference Result 6059 states and 26897 transitions. [2020-02-10 20:06:36,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:36,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:36,109 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 20:06:36,109 INFO L226 Difference]: Without dead ends: 6039 [2020-02-10 20:06:36,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2020-02-10 20:06:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3138. [2020-02-10 20:06:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:06:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15596 transitions. [2020-02-10 20:06:36,316 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15596 transitions. Word has length 31 [2020-02-10 20:06:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:36,316 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15596 transitions. [2020-02-10 20:06:36,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15596 transitions. [2020-02-10 20:06:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:36,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:36,321 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 587821838, now seen corresponding path program 408 times [2020-02-10 20:06:36,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:36,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61716476] [2020-02-10 20:06:36,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:36,875 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:06:37,011 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:06:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:37,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61716476] [2020-02-10 20:06:37,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:37,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:37,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31286438] [2020-02-10 20:06:37,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:37,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:37,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:37,021 INFO L87 Difference]: Start difference. First operand 3138 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:06:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:37,214 INFO L93 Difference]: Finished difference Result 6061 states and 26891 transitions. [2020-02-10 20:06:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:37,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:37,230 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:06:37,230 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:06:37,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:37,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:06:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3112. [2020-02-10 20:06:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:06:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15541 transitions. [2020-02-10 20:06:37,436 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15541 transitions. Word has length 31 [2020-02-10 20:06:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:37,436 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15541 transitions. [2020-02-10 20:06:37,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15541 transitions. [2020-02-10 20:06:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:37,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:37,442 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:37,442 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 102392958, now seen corresponding path program 409 times [2020-02-10 20:06:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55087708] [2020-02-10 20:06:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:37,982 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:38,112 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:38,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:06:38,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55087708] [2020-02-10 20:06:38,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:38,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:38,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666191121] [2020-02-10 20:06:38,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:38,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:38,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:38,122 INFO L87 Difference]: Start difference. First operand 3112 states and 15541 transitions. Second operand 12 states. [2020-02-10 20:06:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:38,356 INFO L93 Difference]: Finished difference Result 6015 states and 26819 transitions. [2020-02-10 20:06:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:38,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:38,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:38,370 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:06:38,370 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:06:38,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:06:38,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 20:06:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:06:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15597 transitions. [2020-02-10 20:06:38,573 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15597 transitions. Word has length 31 [2020-02-10 20:06:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:38,574 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15597 transitions. [2020-02-10 20:06:38,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15597 transitions. [2020-02-10 20:06:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:38,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:38,579 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash -320092768, now seen corresponding path program 410 times [2020-02-10 20:06:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:38,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319941913] [2020-02-10 20:06:38,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:38,945 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-02-10 20:06:39,167 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:39,297 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:39,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:06:39,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319941913] [2020-02-10 20:06:39,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:39,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:39,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910879998] [2020-02-10 20:06:39,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:39,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:39,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:39,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:39,306 INFO L87 Difference]: Start difference. First operand 3128 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:06:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:39,540 INFO L93 Difference]: Finished difference Result 6012 states and 26808 transitions. [2020-02-10 20:06:39,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:39,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:39,555 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:06:39,555 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:06:39,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:06:39,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3123. [2020-02-10 20:06:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:06:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15583 transitions. [2020-02-10 20:06:39,765 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15583 transitions. Word has length 31 [2020-02-10 20:06:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:39,765 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15583 transitions. [2020-02-10 20:06:39,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15583 transitions. [2020-02-10 20:06:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:39,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:39,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:39,771 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -746229514, now seen corresponding path program 411 times [2020-02-10 20:06:39,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:39,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967282526] [2020-02-10 20:06:39,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:40,294 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:40,424 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:40,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:06:40,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967282526] [2020-02-10 20:06:40,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:40,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:40,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229237495] [2020-02-10 20:06:40,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:40,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:40,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:40,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:40,434 INFO L87 Difference]: Start difference. First operand 3123 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:06:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:40,661 INFO L93 Difference]: Finished difference Result 6017 states and 26819 transitions. [2020-02-10 20:06:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:40,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:40,676 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:06:40,676 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:06:40,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:06:40,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:06:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:06:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 20:06:40,876 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 20:06:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:40,877 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 20:06:40,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 20:06:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:40,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:40,882 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:40,882 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1436309152, now seen corresponding path program 412 times [2020-02-10 20:06:40,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:40,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77971678] [2020-02-10 20:06:40,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:41,421 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:41,550 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:41,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:06:41,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77971678] [2020-02-10 20:06:41,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:41,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:41,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607865737] [2020-02-10 20:06:41,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:41,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:41,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:41,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:41,560 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:06:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:41,790 INFO L93 Difference]: Finished difference Result 6015 states and 26809 transitions. [2020-02-10 20:06:41,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:41,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:41,805 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:06:41,805 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:06:41,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:06:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:06:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:06:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15578 transitions. [2020-02-10 20:06:42,006 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15578 transitions. Word has length 31 [2020-02-10 20:06:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:42,007 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15578 transitions. [2020-02-10 20:06:42,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15578 transitions. [2020-02-10 20:06:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:42,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:42,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:42,012 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1380870858, now seen corresponding path program 413 times [2020-02-10 20:06:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957050424] [2020-02-10 20:06:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:42,549 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:42,677 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:42,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957050424] [2020-02-10 20:06:42,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:42,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:42,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030457488] [2020-02-10 20:06:42,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:42,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:42,686 INFO L87 Difference]: Start difference. First operand 3123 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:06:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:42,914 INFO L93 Difference]: Finished difference Result 6010 states and 26799 transitions. [2020-02-10 20:06:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:42,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:42,929 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:06:42,929 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:06:42,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:06:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 20:06:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:06:43,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15587 transitions. [2020-02-10 20:06:43,135 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15587 transitions. Word has length 31 [2020-02-10 20:06:43,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:43,136 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15587 transitions. [2020-02-10 20:06:43,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:43,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15587 transitions. [2020-02-10 20:06:43,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:43,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:43,141 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:43,141 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1224153534, now seen corresponding path program 414 times [2020-02-10 20:06:43,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:43,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152789463] [2020-02-10 20:06:43,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:43,685 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:43,818 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:43,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152789463] [2020-02-10 20:06:43,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:43,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:43,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396037134] [2020-02-10 20:06:43,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:43,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:43,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:43,829 INFO L87 Difference]: Start difference. First operand 3128 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:06:44,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:44,101 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 20:06:44,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:44,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:44,117 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:06:44,117 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:06:44,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:06:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3118. [2020-02-10 20:06:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:06:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15564 transitions. [2020-02-10 20:06:44,332 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15564 transitions. Word has length 31 [2020-02-10 20:06:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:44,332 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15564 transitions. [2020-02-10 20:06:44,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:44,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15564 transitions. [2020-02-10 20:06:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:44,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:44,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:44,338 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1578010536, now seen corresponding path program 415 times [2020-02-10 20:06:44,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:44,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132714923] [2020-02-10 20:06:44,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:44,872 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:45,006 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:45,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132714923] [2020-02-10 20:06:45,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:45,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:45,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67893944] [2020-02-10 20:06:45,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:45,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:45,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:45,017 INFO L87 Difference]: Start difference. First operand 3118 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:06:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:45,246 INFO L93 Difference]: Finished difference Result 6025 states and 26836 transitions. [2020-02-10 20:06:45,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:45,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:45,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:45,261 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:06:45,261 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:06:45,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:06:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3129. [2020-02-10 20:06:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:06:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 20:06:45,462 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 20:06:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:45,462 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 20:06:45,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 20:06:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:45,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:45,467 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1155524810, now seen corresponding path program 416 times [2020-02-10 20:06:45,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:45,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965412114] [2020-02-10 20:06:45,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:45,993 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:46,124 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:46,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:06:46,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965412114] [2020-02-10 20:06:46,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:46,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:46,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934067146] [2020-02-10 20:06:46,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:46,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:46,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:46,134 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:06:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:46,446 INFO L93 Difference]: Finished difference Result 6022 states and 26825 transitions. [2020-02-10 20:06:46,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:46,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:46,461 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:06:46,461 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:06:46,462 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:06:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:06:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:06:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15581 transitions. [2020-02-10 20:06:46,669 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15581 transitions. Word has length 31 [2020-02-10 20:06:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:46,669 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15581 transitions. [2020-02-10 20:06:46,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15581 transitions. [2020-02-10 20:06:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:46,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:46,675 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:46,675 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash -331390026, now seen corresponding path program 417 times [2020-02-10 20:06:46,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:46,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070606352] [2020-02-10 20:06:46,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:47,253 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:06:47,381 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:47,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:06:47,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070606352] [2020-02-10 20:06:47,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:47,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:47,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338803136] [2020-02-10 20:06:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:47,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:47,390 INFO L87 Difference]: Start difference. First operand 3124 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:06:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:47,631 INFO L93 Difference]: Finished difference Result 6035 states and 26853 transitions. [2020-02-10 20:06:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:47,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:47,646 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:06:47,646 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:06:47,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:06:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 20:06:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:06:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 20:06:47,847 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 20:06:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:47,847 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 20:06:47,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 20:06:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:47,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:47,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:47,853 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -261279990, now seen corresponding path program 418 times [2020-02-10 20:06:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:47,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309146344] [2020-02-10 20:06:47,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:48,383 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:48,513 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:48,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309146344] [2020-02-10 20:06:48,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:48,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:48,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521733764] [2020-02-10 20:06:48,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:48,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:48,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:48,522 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:06:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:48,731 INFO L93 Difference]: Finished difference Result 6038 states and 26850 transitions. [2020-02-10 20:06:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:48,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:48,746 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:06:48,746 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:06:48,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:06:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 20:06:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:06:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15575 transitions. [2020-02-10 20:06:48,947 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15575 transitions. Word has length 31 [2020-02-10 20:06:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:48,948 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15575 transitions. [2020-02-10 20:06:48,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15575 transitions. [2020-02-10 20:06:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:48,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:48,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:48,953 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:48,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash -966031370, now seen corresponding path program 419 times [2020-02-10 20:06:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:48,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776543826] [2020-02-10 20:06:48,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:49,473 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:49,604 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:49,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:06:49,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776543826] [2020-02-10 20:06:49,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:49,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:49,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589485275] [2020-02-10 20:06:49,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:49,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:49,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:49,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:49,613 INFO L87 Difference]: Start difference. First operand 3124 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:06:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:49,925 INFO L93 Difference]: Finished difference Result 6026 states and 26826 transitions. [2020-02-10 20:06:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:49,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:49,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:49,939 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:06:49,939 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:06:49,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:06:50,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3130. [2020-02-10 20:06:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:06:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 20:06:50,143 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 20:06:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:50,143 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 20:06:50,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 20:06:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:50,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:50,148 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash -473435608, now seen corresponding path program 420 times [2020-02-10 20:06:50,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:50,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596932126] [2020-02-10 20:06:50,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:50,679 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:06:50,812 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:50,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596932126] [2020-02-10 20:06:50,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:50,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:50,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185699551] [2020-02-10 20:06:50,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:50,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:50,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:50,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:50,822 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:06:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:51,080 INFO L93 Difference]: Finished difference Result 6032 states and 26832 transitions. [2020-02-10 20:06:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:51,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:51,095 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:06:51,095 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:06:51,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:06:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3118. [2020-02-10 20:06:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:06:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15558 transitions. [2020-02-10 20:06:51,300 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15558 transitions. Word has length 31 [2020-02-10 20:06:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:51,300 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15558 transitions. [2020-02-10 20:06:51,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15558 transitions. [2020-02-10 20:06:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:51,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:51,305 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:51,305 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 191895208, now seen corresponding path program 421 times [2020-02-10 20:06:51,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:51,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613663532] [2020-02-10 20:06:51,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:51,827 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:51,959 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:51,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:06:51,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613663532] [2020-02-10 20:06:51,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:51,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:51,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791648374] [2020-02-10 20:06:51,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:51,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:51,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:51,970 INFO L87 Difference]: Start difference. First operand 3118 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:06:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:52,197 INFO L93 Difference]: Finished difference Result 6031 states and 26847 transitions. [2020-02-10 20:06:52,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:52,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:52,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:52,213 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:06:52,213 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:06:52,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:06:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 20:06:52,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:06:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15595 transitions. [2020-02-10 20:06:52,418 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15595 transitions. Word has length 31 [2020-02-10 20:06:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:52,418 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15595 transitions. [2020-02-10 20:06:52,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15595 transitions. [2020-02-10 20:06:52,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:52,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:52,424 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:52,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1920533422, now seen corresponding path program 422 times [2020-02-10 20:06:52,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:52,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808219391] [2020-02-10 20:06:52,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:52,949 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:53,077 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:53,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808219391] [2020-02-10 20:06:53,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:53,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:53,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616414935] [2020-02-10 20:06:53,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:53,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:53,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:53,088 INFO L87 Difference]: Start difference. First operand 3131 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:06:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:53,326 INFO L93 Difference]: Finished difference Result 6029 states and 26837 transitions. [2020-02-10 20:06:53,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:53,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:53,342 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:06:53,342 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:06:53,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:06:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 20:06:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:06:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15578 transitions. [2020-02-10 20:06:53,543 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15578 transitions. Word has length 31 [2020-02-10 20:06:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:53,543 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15578 transitions. [2020-02-10 20:06:53,543 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15578 transitions. [2020-02-10 20:06:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:53,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:53,549 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -868882882, now seen corresponding path program 423 times [2020-02-10 20:06:53,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:53,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326147396] [2020-02-10 20:06:53,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:54,083 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:06:54,220 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:54,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326147396] [2020-02-10 20:06:54,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:54,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:54,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818255140] [2020-02-10 20:06:54,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:54,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:54,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:54,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:54,230 INFO L87 Difference]: Start difference. First operand 3125 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:06:54,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:54,478 INFO L93 Difference]: Finished difference Result 6039 states and 26858 transitions. [2020-02-10 20:06:54,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:54,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:54,493 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:06:54,493 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:06:54,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:06:54,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3134. [2020-02-10 20:06:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:06:54,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 20:06:54,705 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 20:06:54,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:54,706 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 20:06:54,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:54,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 20:06:54,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:54,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:54,711 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:54,711 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash -798772846, now seen corresponding path program 424 times [2020-02-10 20:06:54,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:54,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936684123] [2020-02-10 20:06:54,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:55,257 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:06:55,395 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:55,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936684123] [2020-02-10 20:06:55,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:55,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:55,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684410300] [2020-02-10 20:06:55,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:55,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:55,405 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:06:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:55,633 INFO L93 Difference]: Finished difference Result 6042 states and 26855 transitions. [2020-02-10 20:06:55,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:55,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:55,647 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:06:55,647 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:06:55,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:06:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 20:06:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:06:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:06:55,849 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:06:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:55,850 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:06:55,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:06:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:55,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:55,855 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 252877694, now seen corresponding path program 425 times [2020-02-10 20:06:55,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:55,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486763083] [2020-02-10 20:06:55,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:56,378 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:56,505 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:56,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:06:56,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486763083] [2020-02-10 20:06:56,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:56,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:56,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455510774] [2020-02-10 20:06:56,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:56,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:56,515 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:06:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:56,773 INFO L93 Difference]: Finished difference Result 6033 states and 26837 transitions. [2020-02-10 20:06:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:56,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:56,788 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:06:56,788 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:06:56,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:06:56,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3132. [2020-02-10 20:06:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:06:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15584 transitions. [2020-02-10 20:06:56,990 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15584 transitions. Word has length 31 [2020-02-10 20:06:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:56,991 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15584 transitions. [2020-02-10 20:06:56,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15584 transitions. [2020-02-10 20:06:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:56,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:56,996 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:56,996 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:56,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1859550936, now seen corresponding path program 426 times [2020-02-10 20:06:56,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:56,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704399237] [2020-02-10 20:06:56,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:57,530 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:06:57,659 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:57,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:06:57,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704399237] [2020-02-10 20:06:57,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:57,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:57,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677509524] [2020-02-10 20:06:57,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:57,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:57,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:57,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:57,670 INFO L87 Difference]: Start difference. First operand 3132 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:06:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:57,874 INFO L93 Difference]: Finished difference Result 6038 states and 26840 transitions. [2020-02-10 20:06:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:57,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:57,889 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:06:57,890 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:06:57,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:06:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3118. [2020-02-10 20:06:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:06:58,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15552 transitions. [2020-02-10 20:06:58,091 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15552 transitions. Word has length 31 [2020-02-10 20:06:58,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:58,091 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15552 transitions. [2020-02-10 20:06:58,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15552 transitions. [2020-02-10 20:06:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:58,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:58,096 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1570364298, now seen corresponding path program 427 times [2020-02-10 20:06:58,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:58,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069592940] [2020-02-10 20:06:58,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:58,625 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:06:58,756 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:06:58,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:58,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069592940] [2020-02-10 20:06:58,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:58,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:58,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067949861] [2020-02-10 20:06:58,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:58,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:58,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:58,767 INFO L87 Difference]: Start difference. First operand 3118 states and 15552 transitions. Second operand 12 states. [2020-02-10 20:06:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:06:59,004 INFO L93 Difference]: Finished difference Result 6016 states and 26804 transitions. [2020-02-10 20:06:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:06:59,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:06:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:06:59,019 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:06:59,020 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:06:59,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:06:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:06:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3129. [2020-02-10 20:06:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:06:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15583 transitions. [2020-02-10 20:06:59,225 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15583 transitions. Word has length 31 [2020-02-10 20:06:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:06:59,225 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15583 transitions. [2020-02-10 20:06:59,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:06:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15583 transitions. [2020-02-10 20:06:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:06:59,231 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:06:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:06:59,231 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:06:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:06:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash -119578606, now seen corresponding path program 428 times [2020-02-10 20:06:59,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:06:59,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429097577] [2020-02-10 20:06:59,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:06:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:06:59,755 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:06:59,883 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:06:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:06:59,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429097577] [2020-02-10 20:06:59,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:06:59,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:06:59,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580597547] [2020-02-10 20:06:59,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:06:59,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:06:59,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:06:59,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:06:59,894 INFO L87 Difference]: Start difference. First operand 3129 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:07:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:00,130 INFO L93 Difference]: Finished difference Result 6017 states and 26801 transitions. [2020-02-10 20:07:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:00,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:00,145 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:07:00,145 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:07:00,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:07:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3124. [2020-02-10 20:07:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:07:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:07:00,356 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:07:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:00,356 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:07:00,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:07:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:00,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:00,361 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:00,361 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:00,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash 509586208, now seen corresponding path program 429 times [2020-02-10 20:07:00,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:00,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149314052] [2020-02-10 20:07:00,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:00,890 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:07:01,021 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:07:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:01,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149314052] [2020-02-10 20:07:01,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:01,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:01,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293513571] [2020-02-10 20:07:01,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:01,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:01,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:01,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:01,030 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:07:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:01,299 INFO L93 Difference]: Finished difference Result 6022 states and 26810 transitions. [2020-02-10 20:07:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:01,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:01,314 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:07:01,314 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:07:01,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:07:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:07:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:07:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15580 transitions. [2020-02-10 20:07:01,521 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15580 transitions. Word has length 31 [2020-02-10 20:07:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:01,522 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15580 transitions. [2020-02-10 20:07:01,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15580 transitions. [2020-02-10 20:07:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:01,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:01,527 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:01,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1002181970, now seen corresponding path program 430 times [2020-02-10 20:07:01,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:01,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868979595] [2020-02-10 20:07:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:02,078 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:02,210 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:07:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:02,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868979595] [2020-02-10 20:07:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:02,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:02,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810565920] [2020-02-10 20:07:02,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:02,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:02,220 INFO L87 Difference]: Start difference. First operand 3130 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:07:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:02,418 INFO L93 Difference]: Finished difference Result 6028 states and 26816 transitions. [2020-02-10 20:07:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:02,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:02,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:02,433 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:07:02,433 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:07:02,434 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:07:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 20:07:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:07:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15563 transitions. [2020-02-10 20:07:02,635 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15563 transitions. Word has length 31 [2020-02-10 20:07:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:02,635 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15563 transitions. [2020-02-10 20:07:02,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15563 transitions. [2020-02-10 20:07:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:02,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:02,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:02,640 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2028979168, now seen corresponding path program 431 times [2020-02-10 20:07:02,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:02,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613880824] [2020-02-10 20:07:02,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:03,181 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:03,312 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:03,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:07:03,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613880824] [2020-02-10 20:07:03,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:03,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:03,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725154409] [2020-02-10 20:07:03,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:03,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:03,322 INFO L87 Difference]: Start difference. First operand 3124 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:07:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:03,572 INFO L93 Difference]: Finished difference Result 6025 states and 26811 transitions. [2020-02-10 20:07:03,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:03,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:03,587 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:07:03,587 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:07:03,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:07:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 20:07:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:07:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15576 transitions. [2020-02-10 20:07:03,832 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15576 transitions. Word has length 31 [2020-02-10 20:07:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:03,832 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15576 transitions. [2020-02-10 20:07:03,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15576 transitions. [2020-02-10 20:07:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:03,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:03,837 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:03,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash 153559498, now seen corresponding path program 432 times [2020-02-10 20:07:03,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:03,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223028858] [2020-02-10 20:07:03,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:04,379 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:04,509 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:04,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:07:04,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223028858] [2020-02-10 20:07:04,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:04,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720134912] [2020-02-10 20:07:04,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:04,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:04,519 INFO L87 Difference]: Start difference. First operand 3131 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:07:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:04,717 INFO L93 Difference]: Finished difference Result 6030 states and 26814 transitions. [2020-02-10 20:07:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:04,718 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:04,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:04,732 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:07:04,732 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:07:04,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:07:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3112. [2020-02-10 20:07:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:07:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15535 transitions. [2020-02-10 20:07:04,933 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15535 transitions. Word has length 31 [2020-02-10 20:07:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:04,933 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15535 transitions. [2020-02-10 20:07:04,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15535 transitions. [2020-02-10 20:07:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:04,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:04,938 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:04,938 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash -331869382, now seen corresponding path program 433 times [2020-02-10 20:07:04,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:04,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339896937] [2020-02-10 20:07:04,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:05,471 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:07:05,603 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:07:05,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:07:05,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339896937] [2020-02-10 20:07:05,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:05,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049508152] [2020-02-10 20:07:05,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:05,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:05,614 INFO L87 Difference]: Start difference. First operand 3112 states and 15535 transitions. Second operand 12 states. [2020-02-10 20:07:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:05,916 INFO L93 Difference]: Finished difference Result 6055 states and 26922 transitions. [2020-02-10 20:07:05,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:05,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:05,931 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:07:05,931 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:07:05,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:07:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 20:07:06,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:07:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 20:07:06,137 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 20:07:06,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:06,137 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 20:07:06,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 20:07:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:06,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:06,145 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1599326560, now seen corresponding path program 434 times [2020-02-10 20:07:06,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:06,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029394588] [2020-02-10 20:07:06,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:06,690 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:06,818 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:06,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:07:06,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029394588] [2020-02-10 20:07:06,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:06,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:06,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113621990] [2020-02-10 20:07:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:06,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:06,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:06,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:06,828 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:07:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:07,076 INFO L93 Difference]: Finished difference Result 6056 states and 26916 transitions. [2020-02-10 20:07:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:07,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:07,090 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:07:07,091 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:07:07,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:07:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 20:07:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:07:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15590 transitions. [2020-02-10 20:07:07,289 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15590 transitions. Word has length 31 [2020-02-10 20:07:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:07,289 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15590 transitions. [2020-02-10 20:07:07,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15590 transitions. [2020-02-10 20:07:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:07,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:07,294 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:07,294 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -756180618, now seen corresponding path program 435 times [2020-02-10 20:07:07,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:07,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080961740] [2020-02-10 20:07:07,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:07,842 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:07:07,970 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:07:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:07,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080961740] [2020-02-10 20:07:07,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:07,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:07,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033571409] [2020-02-10 20:07:07,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:07,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:07,981 INFO L87 Difference]: Start difference. First operand 3127 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:07:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:08,215 INFO L93 Difference]: Finished difference Result 6050 states and 26904 transitions. [2020-02-10 20:07:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:08,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:08,230 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:07:08,230 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:07:08,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:07:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3133. [2020-02-10 20:07:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:07:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15601 transitions. [2020-02-10 20:07:08,431 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15601 transitions. Word has length 31 [2020-02-10 20:07:08,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:08,431 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15601 transitions. [2020-02-10 20:07:08,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15601 transitions. [2020-02-10 20:07:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:08,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:08,436 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1426358048, now seen corresponding path program 436 times [2020-02-10 20:07:08,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:08,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151208743] [2020-02-10 20:07:08,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:08,980 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:07:09,114 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:07:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:09,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151208743] [2020-02-10 20:07:09,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:09,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:09,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245858912] [2020-02-10 20:07:09,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:09,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:09,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:09,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:09,124 INFO L87 Difference]: Start difference. First operand 3133 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:07:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:09,403 INFO L93 Difference]: Finished difference Result 6048 states and 26894 transitions. [2020-02-10 20:07:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:09,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:09,418 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:07:09,418 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:07:09,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:07:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 20:07:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:07:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15584 transitions. [2020-02-10 20:07:09,619 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15584 transitions. Word has length 31 [2020-02-10 20:07:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:09,619 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15584 transitions. [2020-02-10 20:07:09,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15584 transitions. [2020-02-10 20:07:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:09,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:09,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:09,624 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:09,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:09,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1634862646, now seen corresponding path program 437 times [2020-02-10 20:07:09,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:09,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106850253] [2020-02-10 20:07:09,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:10,164 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:10,296 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:10,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:07:10,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106850253] [2020-02-10 20:07:10,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:10,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:10,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146676345] [2020-02-10 20:07:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:10,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:10,305 INFO L87 Difference]: Start difference. First operand 3127 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:07:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:10,659 INFO L93 Difference]: Finished difference Result 6052 states and 26902 transitions. [2020-02-10 20:07:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:10,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:10,674 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:07:10,674 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:07:10,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:07:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3133. [2020-02-10 20:07:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:07:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15595 transitions. [2020-02-10 20:07:10,880 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15595 transitions. Word has length 31 [2020-02-10 20:07:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:10,881 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15595 transitions. [2020-02-10 20:07:10,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15595 transitions. [2020-02-10 20:07:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:10,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:10,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:10,886 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash 789891194, now seen corresponding path program 438 times [2020-02-10 20:07:10,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:10,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280131234] [2020-02-10 20:07:10,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:11,434 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:11,564 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:11,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:07:11,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280131234] [2020-02-10 20:07:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738518110] [2020-02-10 20:07:11,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:11,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:11,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:11,575 INFO L87 Difference]: Start difference. First operand 3133 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:07:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:11,901 INFO L93 Difference]: Finished difference Result 6049 states and 26890 transitions. [2020-02-10 20:07:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:11,902 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:11,916 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:07:11,917 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:07:11,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:07:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3121. [2020-02-10 20:07:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:07:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15567 transitions. [2020-02-10 20:07:12,125 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15567 transitions. Word has length 31 [2020-02-10 20:07:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:12,125 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15567 transitions. [2020-02-10 20:07:12,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15567 transitions. [2020-02-10 20:07:12,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:12,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:12,131 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1143748196, now seen corresponding path program 439 times [2020-02-10 20:07:12,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:12,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349552048] [2020-02-10 20:07:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:12,731 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:07:12,861 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:07:12,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:07:12,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349552048] [2020-02-10 20:07:12,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:12,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:12,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383025428] [2020-02-10 20:07:12,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:12,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:12,872 INFO L87 Difference]: Start difference. First operand 3121 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:07:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:13,234 INFO L93 Difference]: Finished difference Result 6073 states and 26959 transitions. [2020-02-10 20:07:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:13,235 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:13,253 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:07:13,253 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:07:13,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:07:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3140. [2020-02-10 20:07:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:07:13,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15619 transitions. [2020-02-10 20:07:13,463 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15619 transitions. Word has length 31 [2020-02-10 20:07:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:13,463 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15619 transitions. [2020-02-10 20:07:13,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15619 transitions. [2020-02-10 20:07:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:13,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:13,469 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:13,469 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:13,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:13,469 INFO L82 PathProgramCache]: Analyzing trace with hash -123708982, now seen corresponding path program 440 times [2020-02-10 20:07:13,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:13,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657338221] [2020-02-10 20:07:13,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:14,023 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:14,150 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:14,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:07:14,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657338221] [2020-02-10 20:07:14,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:14,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:14,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798794044] [2020-02-10 20:07:14,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:14,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:14,160 INFO L87 Difference]: Start difference. First operand 3140 states and 15619 transitions. Second operand 12 states. [2020-02-10 20:07:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:14,486 INFO L93 Difference]: Finished difference Result 6074 states and 26953 transitions. [2020-02-10 20:07:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:14,486 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:14,501 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:07:14,501 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:07:14,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:07:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3132. [2020-02-10 20:07:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:07:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 20:07:14,705 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 20:07:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:14,705 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 20:07:14,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 20:07:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:14,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:14,710 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash -341341130, now seen corresponding path program 441 times [2020-02-10 20:07:14,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:14,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633158337] [2020-02-10 20:07:14,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:15,259 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:15,394 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:15,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:07:15,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633158337] [2020-02-10 20:07:15,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:15,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:15,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145553257] [2020-02-10 20:07:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:15,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:15,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:15,404 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:07:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:15,729 INFO L93 Difference]: Finished difference Result 6076 states and 26956 transitions. [2020-02-10 20:07:15,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:15,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:15,744 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:07:15,745 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:07:15,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:07:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3141. [2020-02-10 20:07:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:07:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15613 transitions. [2020-02-10 20:07:15,951 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15613 transitions. Word has length 31 [2020-02-10 20:07:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:15,951 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15613 transitions. [2020-02-10 20:07:15,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15613 transitions. [2020-02-10 20:07:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:15,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:15,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:15,957 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:15,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:15,957 INFO L82 PathProgramCache]: Analyzing trace with hash -271231094, now seen corresponding path program 442 times [2020-02-10 20:07:15,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:15,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131101903] [2020-02-10 20:07:15,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:16,518 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:16,649 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:16,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:07:16,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131101903] [2020-02-10 20:07:16,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:16,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:16,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460712494] [2020-02-10 20:07:16,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:16,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:16,660 INFO L87 Difference]: Start difference. First operand 3141 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:07:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:16,980 INFO L93 Difference]: Finished difference Result 6079 states and 26953 transitions. [2020-02-10 20:07:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:16,980 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:16,995 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:07:16,995 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:07:16,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:17,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:07:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 20:07:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:07:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15587 transitions. [2020-02-10 20:07:17,199 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15587 transitions. Word has length 31 [2020-02-10 20:07:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:17,199 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15587 transitions. [2020-02-10 20:07:17,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15587 transitions. [2020-02-10 20:07:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:17,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:17,205 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:17,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2049702134, now seen corresponding path program 443 times [2020-02-10 20:07:17,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:17,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279703393] [2020-02-10 20:07:17,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:17,758 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:17,891 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:17,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:07:17,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279703393] [2020-02-10 20:07:17,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:17,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:17,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493050569] [2020-02-10 20:07:17,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:17,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:17,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:17,902 INFO L87 Difference]: Start difference. First operand 3132 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:07:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:18,166 INFO L93 Difference]: Finished difference Result 6080 states and 26955 transitions. [2020-02-10 20:07:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:18,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:18,182 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 20:07:18,182 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 20:07:18,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 20:07:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3143. [2020-02-10 20:07:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:07:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15607 transitions. [2020-02-10 20:07:18,382 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15607 transitions. Word has length 31 [2020-02-10 20:07:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:18,382 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15607 transitions. [2020-02-10 20:07:18,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15607 transitions. [2020-02-10 20:07:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:18,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:18,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:18,388 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -907697948, now seen corresponding path program 444 times [2020-02-10 20:07:18,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:18,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574867698] [2020-02-10 20:07:18,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:18,953 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:19,084 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:19,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:07:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574867698] [2020-02-10 20:07:19,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:19,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:19,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133713770] [2020-02-10 20:07:19,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:19,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:19,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:19,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:19,095 INFO L87 Difference]: Start difference. First operand 3143 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:07:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:19,277 INFO L93 Difference]: Finished difference Result 6082 states and 26949 transitions. [2020-02-10 20:07:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:19,278 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:19,293 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:07:19,293 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:07:19,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:07:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3121. [2020-02-10 20:07:19,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:07:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 20:07:19,499 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 20:07:19,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:19,499 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 20:07:19,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 20:07:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:19,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:19,504 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash 450690532, now seen corresponding path program 445 times [2020-02-10 20:07:19,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:19,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492635015] [2020-02-10 20:07:19,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:20,040 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:20,173 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:20,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492635015] [2020-02-10 20:07:20,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:20,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:20,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397579229] [2020-02-10 20:07:20,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:20,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:20,183 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:07:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:20,405 INFO L93 Difference]: Finished difference Result 6055 states and 26905 transitions. [2020-02-10 20:07:20,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:20,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:20,420 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:07:20,420 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:07:20,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:07:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 20:07:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:07:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 20:07:20,625 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 20:07:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:20,625 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 20:07:20,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 20:07:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:20,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:20,631 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1661738098, now seen corresponding path program 446 times [2020-02-10 20:07:20,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:20,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100042328] [2020-02-10 20:07:20,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:20,995 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2020-02-10 20:07:21,217 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:21,345 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:21,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100042328] [2020-02-10 20:07:21,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:21,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:21,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303350970] [2020-02-10 20:07:21,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:21,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:21,356 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:07:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:21,573 INFO L93 Difference]: Finished difference Result 6053 states and 26895 transitions. [2020-02-10 20:07:21,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:21,574 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:21,588 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:07:21,589 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:07:21,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:07:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3128. [2020-02-10 20:07:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:07:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15578 transitions. [2020-02-10 20:07:21,792 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15578 transitions. Word has length 31 [2020-02-10 20:07:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:21,793 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15578 transitions. [2020-02-10 20:07:21,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15578 transitions. [2020-02-10 20:07:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:21,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:21,798 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:21,798 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -610087558, now seen corresponding path program 447 times [2020-02-10 20:07:21,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:21,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653861811] [2020-02-10 20:07:21,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:22,338 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:22,465 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:22,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:07:22,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653861811] [2020-02-10 20:07:22,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:22,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:22,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926181098] [2020-02-10 20:07:22,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:22,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:22,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:22,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:22,474 INFO L87 Difference]: Start difference. First operand 3128 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:07:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:22,711 INFO L93 Difference]: Finished difference Result 6063 states and 26916 transitions. [2020-02-10 20:07:22,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:22,712 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:22,727 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:07:22,727 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 20:07:22,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 20:07:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3137. [2020-02-10 20:07:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:07:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15595 transitions. [2020-02-10 20:07:22,932 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15595 transitions. Word has length 31 [2020-02-10 20:07:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:22,932 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15595 transitions. [2020-02-10 20:07:22,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15595 transitions. [2020-02-10 20:07:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:22,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:22,938 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:22,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash -539977522, now seen corresponding path program 448 times [2020-02-10 20:07:22,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:22,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259668327] [2020-02-10 20:07:22,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:23,485 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:23,612 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:23,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:23,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259668327] [2020-02-10 20:07:23,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:23,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:23,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380464938] [2020-02-10 20:07:23,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:23,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:23,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:23,623 INFO L87 Difference]: Start difference. First operand 3137 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:07:23,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:23,890 INFO L93 Difference]: Finished difference Result 6066 states and 26913 transitions. [2020-02-10 20:07:23,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:23,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:23,905 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:07:23,905 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 20:07:23,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:24,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 20:07:24,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3128. [2020-02-10 20:07:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:07:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15571 transitions. [2020-02-10 20:07:24,108 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15571 transitions. Word has length 31 [2020-02-10 20:07:24,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:24,108 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15571 transitions. [2020-02-10 20:07:24,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15571 transitions. [2020-02-10 20:07:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:24,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:24,113 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash 511673018, now seen corresponding path program 449 times [2020-02-10 20:07:24,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:24,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390415211] [2020-02-10 20:07:24,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:24,768 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:24,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:07:24,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390415211] [2020-02-10 20:07:24,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:24,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:24,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863179739] [2020-02-10 20:07:24,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:24,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:24,779 INFO L87 Difference]: Start difference. First operand 3128 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:07:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:25,078 INFO L93 Difference]: Finished difference Result 6057 states and 26895 transitions. [2020-02-10 20:07:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:25,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:25,092 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:07:25,093 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:07:25,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:07:25,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3135. [2020-02-10 20:07:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:07:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15584 transitions. [2020-02-10 20:07:25,296 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15584 transitions. Word has length 31 [2020-02-10 20:07:25,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:25,297 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15584 transitions. [2020-02-10 20:07:25,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15584 transitions. [2020-02-10 20:07:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:25,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:25,302 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:25,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1600755612, now seen corresponding path program 450 times [2020-02-10 20:07:25,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:25,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032853441] [2020-02-10 20:07:25,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:25,846 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:07:25,972 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:07:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:25,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032853441] [2020-02-10 20:07:25,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:25,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:25,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96485585] [2020-02-10 20:07:25,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:25,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:25,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:25,982 INFO L87 Difference]: Start difference. First operand 3135 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:07:26,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:26,179 INFO L93 Difference]: Finished difference Result 6062 states and 26898 transitions. [2020-02-10 20:07:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:26,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:26,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:26,194 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:07:26,194 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:07:26,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:07:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 20:07:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:07:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15551 transitions. [2020-02-10 20:07:26,398 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15551 transitions. Word has length 31 [2020-02-10 20:07:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:26,398 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15551 transitions. [2020-02-10 20:07:26,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15551 transitions. [2020-02-10 20:07:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:26,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:26,404 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:26,404 INFO L82 PathProgramCache]: Analyzing trace with hash 291130506, now seen corresponding path program 451 times [2020-02-10 20:07:26,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:26,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761594928] [2020-02-10 20:07:26,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:27,074 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:27,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761594928] [2020-02-10 20:07:27,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:27,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:27,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167564199] [2020-02-10 20:07:27,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:27,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:27,084 INFO L87 Difference]: Start difference. First operand 3121 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:07:27,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:27,330 INFO L93 Difference]: Finished difference Result 6061 states and 26910 transitions. [2020-02-10 20:07:27,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:27,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:27,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:27,345 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:07:27,345 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:07:27,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:07:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3135. [2020-02-10 20:07:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:07:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15590 transitions. [2020-02-10 20:07:27,544 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15590 transitions. Word has length 31 [2020-02-10 20:07:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:27,544 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15590 transitions. [2020-02-10 20:07:27,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15590 transitions. [2020-02-10 20:07:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:27,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:27,549 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -553840946, now seen corresponding path program 452 times [2020-02-10 20:07:27,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:27,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193028114] [2020-02-10 20:07:27,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:28,104 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:28,236 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:28,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193028114] [2020-02-10 20:07:28,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:28,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:28,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668525449] [2020-02-10 20:07:28,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:28,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:28,246 INFO L87 Difference]: Start difference. First operand 3135 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:07:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:28,469 INFO L93 Difference]: Finished difference Result 6058 states and 26898 transitions. [2020-02-10 20:07:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:28,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:28,483 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:07:28,483 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 20:07:28,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 20:07:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3129. [2020-02-10 20:07:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:07:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15573 transitions. [2020-02-10 20:07:28,683 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15573 transitions. Word has length 31 [2020-02-10 20:07:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:28,683 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15573 transitions. [2020-02-10 20:07:28,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15573 transitions. [2020-02-10 20:07:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:28,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:28,688 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash -769647584, now seen corresponding path program 453 times [2020-02-10 20:07:28,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:28,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197631429] [2020-02-10 20:07:28,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:29,262 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:29,396 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:29,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197631429] [2020-02-10 20:07:29,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:29,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:29,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372286665] [2020-02-10 20:07:29,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:29,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:29,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:29,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:29,405 INFO L87 Difference]: Start difference. First operand 3129 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:07:29,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:29,671 INFO L93 Difference]: Finished difference Result 6071 states and 26925 transitions. [2020-02-10 20:07:29,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:29,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:29,686 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:07:29,686 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:07:29,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:07:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 20:07:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:07:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15593 transitions. [2020-02-10 20:07:29,886 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15593 transitions. Word has length 31 [2020-02-10 20:07:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:29,886 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15593 transitions. [2020-02-10 20:07:29,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15593 transitions. [2020-02-10 20:07:29,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:29,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:29,891 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:29,892 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:29,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 567919630, now seen corresponding path program 454 times [2020-02-10 20:07:29,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:29,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216265051] [2020-02-10 20:07:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:30,453 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:30,584 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:30,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216265051] [2020-02-10 20:07:30,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:30,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:30,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835609125] [2020-02-10 20:07:30,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:30,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:30,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:30,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:30,595 INFO L87 Difference]: Start difference. First operand 3140 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:07:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:30,812 INFO L93 Difference]: Finished difference Result 6073 states and 26919 transitions. [2020-02-10 20:07:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:30,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:30,827 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:07:30,827 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:07:30,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:07:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 20:07:31,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:07:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15565 transitions. [2020-02-10 20:07:31,035 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15565 transitions. Word has length 31 [2020-02-10 20:07:31,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:31,036 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15565 transitions. [2020-02-10 20:07:31,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15565 transitions. [2020-02-10 20:07:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:31,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:31,041 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:31,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2038930272, now seen corresponding path program 455 times [2020-02-10 20:07:31,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:31,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898510650] [2020-02-10 20:07:31,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:31,706 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:31,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:07:31,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898510650] [2020-02-10 20:07:31,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:31,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:31,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060281827] [2020-02-10 20:07:31,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:31,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:31,716 INFO L87 Difference]: Start difference. First operand 3129 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:07:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:31,966 INFO L93 Difference]: Finished difference Result 6061 states and 26895 transitions. [2020-02-10 20:07:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:31,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:31,979 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:07:31,979 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 20:07:31,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 20:07:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3136. [2020-02-10 20:07:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:07:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15578 transitions. [2020-02-10 20:07:32,179 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15578 transitions. Word has length 31 [2020-02-10 20:07:32,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:32,180 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15578 transitions. [2020-02-10 20:07:32,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15578 transitions. [2020-02-10 20:07:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:32,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:32,185 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:32,185 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 143608394, now seen corresponding path program 456 times [2020-02-10 20:07:32,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:32,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19747082] [2020-02-10 20:07:32,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:32,731 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:32,864 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:32,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:07:32,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19747082] [2020-02-10 20:07:32,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:32,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:32,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485978132] [2020-02-10 20:07:32,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:32,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:32,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:32,874 INFO L87 Difference]: Start difference. First operand 3136 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:07:33,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:33,064 INFO L93 Difference]: Finished difference Result 6066 states and 26898 transitions. [2020-02-10 20:07:33,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:33,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:33,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:33,079 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:07:33,079 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:07:33,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:07:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3112. [2020-02-10 20:07:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:07:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15527 transitions. [2020-02-10 20:07:33,283 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15527 transitions. Word has length 31 [2020-02-10 20:07:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:33,283 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15527 transitions. [2020-02-10 20:07:33,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15527 transitions. [2020-02-10 20:07:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:33,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:33,288 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:33,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -971486278, now seen corresponding path program 457 times [2020-02-10 20:07:33,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:33,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006689442] [2020-02-10 20:07:33,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:33,830 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:33,962 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:33,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006689442] [2020-02-10 20:07:33,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:33,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:33,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496731553] [2020-02-10 20:07:33,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:33,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:33,972 INFO L87 Difference]: Start difference. First operand 3112 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:07:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:34,199 INFO L93 Difference]: Finished difference Result 6020 states and 26816 transitions. [2020-02-10 20:07:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:34,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:34,213 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:07:34,213 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 20:07:34,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 20:07:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3129. [2020-02-10 20:07:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:07:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15586 transitions. [2020-02-10 20:07:34,416 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15586 transitions. Word has length 31 [2020-02-10 20:07:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:34,416 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15586 transitions. [2020-02-10 20:07:34,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15586 transitions. [2020-02-10 20:07:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:34,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:34,422 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:34,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1816457730, now seen corresponding path program 458 times [2020-02-10 20:07:34,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:34,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806787780] [2020-02-10 20:07:34,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:34,962 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:35,095 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:35,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806787780] [2020-02-10 20:07:35,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:35,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:35,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653594437] [2020-02-10 20:07:35,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:35,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:35,105 INFO L87 Difference]: Start difference. First operand 3129 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:07:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:35,336 INFO L93 Difference]: Finished difference Result 6024 states and 26819 transitions. [2020-02-10 20:07:35,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:35,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:35,351 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:07:35,351 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:07:35,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:35,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:07:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3124. [2020-02-10 20:07:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:07:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15572 transitions. [2020-02-10 20:07:35,556 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15572 transitions. Word has length 31 [2020-02-10 20:07:35,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:35,557 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15572 transitions. [2020-02-10 20:07:35,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15572 transitions. [2020-02-10 20:07:35,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:35,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:35,562 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:35,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:35,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1395797514, now seen corresponding path program 459 times [2020-02-10 20:07:35,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:35,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475840188] [2020-02-10 20:07:35,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:36,124 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:36,252 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:36,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475840188] [2020-02-10 20:07:36,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:36,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:36,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926619761] [2020-02-10 20:07:36,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:36,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:36,262 INFO L87 Difference]: Start difference. First operand 3124 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:07:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:36,508 INFO L93 Difference]: Finished difference Result 6017 states and 26805 transitions. [2020-02-10 20:07:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:36,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:36,524 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:07:36,524 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:07:36,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:07:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3129. [2020-02-10 20:07:36,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:07:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 20:07:36,727 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 20:07:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:36,727 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 20:07:36,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 20:07:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:36,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:36,733 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1209226878, now seen corresponding path program 460 times [2020-02-10 20:07:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:36,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186765428] [2020-02-10 20:07:36,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:37,283 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:37,414 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:37,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:07:37,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186765428] [2020-02-10 20:07:37,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:37,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:37,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18888043] [2020-02-10 20:07:37,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:37,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:37,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:37,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:37,425 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:07:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:37,671 INFO L93 Difference]: Finished difference Result 6018 states and 26802 transitions. [2020-02-10 20:07:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:37,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:37,686 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:07:37,686 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:07:37,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:07:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3124. [2020-02-10 20:07:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:07:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15567 transitions. [2020-02-10 20:07:37,941 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15567 transitions. Word has length 31 [2020-02-10 20:07:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:37,941 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15567 transitions. [2020-02-10 20:07:37,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15567 transitions. [2020-02-10 20:07:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:37,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:37,947 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1629887094, now seen corresponding path program 461 times [2020-02-10 20:07:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253892642] [2020-02-10 20:07:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:38,490 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:38,622 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:38,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:07:38,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253892642] [2020-02-10 20:07:38,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:38,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:38,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536318226] [2020-02-10 20:07:38,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:38,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:38,634 INFO L87 Difference]: Start difference. First operand 3124 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:07:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:38,986 INFO L93 Difference]: Finished difference Result 6026 states and 26819 transitions. [2020-02-10 20:07:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:38,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:39,001 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:07:39,001 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:07:39,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:07:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:07:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:07:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15578 transitions. [2020-02-10 20:07:39,201 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15578 transitions. Word has length 31 [2020-02-10 20:07:39,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:39,201 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15578 transitions. [2020-02-10 20:07:39,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15578 transitions. [2020-02-10 20:07:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:39,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:39,206 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:39,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 784915642, now seen corresponding path program 462 times [2020-02-10 20:07:39,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:39,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368566524] [2020-02-10 20:07:39,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:39,872 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:39,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368566524] [2020-02-10 20:07:39,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:39,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:39,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567240618] [2020-02-10 20:07:39,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:39,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:39,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:39,882 INFO L87 Difference]: Start difference. First operand 3130 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:07:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:40,135 INFO L93 Difference]: Finished difference Result 6023 states and 26807 transitions. [2020-02-10 20:07:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:40,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:40,150 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:07:40,150 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:07:40,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:07:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3119. [2020-02-10 20:07:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:07:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15553 transitions. [2020-02-10 20:07:40,349 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15553 transitions. Word has length 31 [2020-02-10 20:07:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:40,349 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15553 transitions. [2020-02-10 20:07:40,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:40,350 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15553 transitions. [2020-02-10 20:07:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:40,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:40,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:40,355 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:40,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:40,355 INFO L82 PathProgramCache]: Analyzing trace with hash 504131300, now seen corresponding path program 463 times [2020-02-10 20:07:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:40,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021148401] [2020-02-10 20:07:40,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:40,898 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:41,027 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:41,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:07:41,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021148401] [2020-02-10 20:07:41,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:41,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:41,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211770524] [2020-02-10 20:07:41,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:41,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:41,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:41,037 INFO L87 Difference]: Start difference. First operand 3119 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:07:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:41,366 INFO L93 Difference]: Finished difference Result 6033 states and 26839 transitions. [2020-02-10 20:07:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:41,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:41,380 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:07:41,381 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:07:41,381 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:07:41,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3131. [2020-02-10 20:07:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:07:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15586 transitions. [2020-02-10 20:07:41,583 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15586 transitions. Word has length 31 [2020-02-10 20:07:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:41,583 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15586 transitions. [2020-02-10 20:07:41,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:41,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15586 transitions. [2020-02-10 20:07:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:41,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:41,589 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:41,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:41,589 INFO L82 PathProgramCache]: Analyzing trace with hash -340840152, now seen corresponding path program 464 times [2020-02-10 20:07:41,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287007237] [2020-02-10 20:07:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:42,134 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:42,265 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:42,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:07:42,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287007237] [2020-02-10 20:07:42,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:42,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:42,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173205296] [2020-02-10 20:07:42,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:42,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:42,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:42,274 INFO L87 Difference]: Start difference. First operand 3131 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:07:42,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:42,509 INFO L93 Difference]: Finished difference Result 6037 states and 26842 transitions. [2020-02-10 20:07:42,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:42,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:42,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:42,524 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:07:42,525 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:07:42,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:42,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:07:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3126. [2020-02-10 20:07:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:07:42,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:07:42,729 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:07:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:42,729 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:07:42,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:07:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:42,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:42,734 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:42,734 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash -980958026, now seen corresponding path program 465 times [2020-02-10 20:07:42,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:42,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038073299] [2020-02-10 20:07:42,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:43,275 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:43,409 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:43,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:07:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038073299] [2020-02-10 20:07:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:43,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385315127] [2020-02-10 20:07:43,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:43,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:43,419 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:07:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:43,663 INFO L93 Difference]: Finished difference Result 6036 states and 26839 transitions. [2020-02-10 20:07:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:43,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:43,678 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:07:43,678 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:07:43,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:07:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3132. [2020-02-10 20:07:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:07:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15583 transitions. [2020-02-10 20:07:43,883 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15583 transitions. Word has length 31 [2020-02-10 20:07:43,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:43,883 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15583 transitions. [2020-02-10 20:07:43,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15583 transitions. [2020-02-10 20:07:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:43,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:43,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:43,889 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash -488362264, now seen corresponding path program 466 times [2020-02-10 20:07:43,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:43,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286823237] [2020-02-10 20:07:43,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:44,427 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:07:44,554 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:44,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286823237] [2020-02-10 20:07:44,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:44,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:44,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168663326] [2020-02-10 20:07:44,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:44,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:44,564 INFO L87 Difference]: Start difference. First operand 3132 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:07:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:44,794 INFO L93 Difference]: Finished difference Result 6042 states and 26845 transitions. [2020-02-10 20:07:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:44,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:44,809 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:07:44,809 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:07:44,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:07:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3126. [2020-02-10 20:07:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:07:45,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15566 transitions. [2020-02-10 20:07:45,008 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15566 transitions. Word has length 31 [2020-02-10 20:07:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:45,008 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15566 transitions. [2020-02-10 20:07:45,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15566 transitions. [2020-02-10 20:07:45,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:45,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:45,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:45,014 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2044726582, now seen corresponding path program 467 times [2020-02-10 20:07:45,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:45,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93638102] [2020-02-10 20:07:45,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:45,573 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:45,703 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:45,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93638102] [2020-02-10 20:07:45,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:45,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:45,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692690924] [2020-02-10 20:07:45,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:45,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:45,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:45,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:45,713 INFO L87 Difference]: Start difference. First operand 3126 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:07:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:45,989 INFO L93 Difference]: Finished difference Result 6049 states and 26862 transitions. [2020-02-10 20:07:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:45,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:46,004 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:07:46,004 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 20:07:46,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 20:07:46,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3137. [2020-02-10 20:07:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:07:46,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 20:07:46,207 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 20:07:46,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:46,207 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 20:07:46,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:46,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 20:07:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:46,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:46,213 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash -912673500, now seen corresponding path program 468 times [2020-02-10 20:07:46,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:46,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297585144] [2020-02-10 20:07:46,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:46,589 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-02-10 20:07:46,831 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:07:46,965 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:46,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:07:46,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297585144] [2020-02-10 20:07:46,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:46,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:46,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571291085] [2020-02-10 20:07:46,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:46,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:46,974 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:07:47,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:47,191 INFO L93 Difference]: Finished difference Result 6051 states and 26856 transitions. [2020-02-10 20:07:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:47,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:47,206 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:07:47,206 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:07:47,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:07:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3119. [2020-02-10 20:07:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:07:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15546 transitions. [2020-02-10 20:07:47,411 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15546 transitions. Word has length 31 [2020-02-10 20:07:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:47,411 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15546 transitions. [2020-02-10 20:07:47,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15546 transitions. [2020-02-10 20:07:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:47,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:47,416 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:47,416 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:47,416 INFO L82 PathProgramCache]: Analyzing trace with hash -188926364, now seen corresponding path program 469 times [2020-02-10 20:07:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527146465] [2020-02-10 20:07:47,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:47,965 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:48,095 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:48,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527146465] [2020-02-10 20:07:48,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:48,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:48,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271412426] [2020-02-10 20:07:48,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:48,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:48,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:48,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:48,105 INFO L87 Difference]: Start difference. First operand 3119 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:07:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:48,402 INFO L93 Difference]: Finished difference Result 6022 states and 26808 transitions. [2020-02-10 20:07:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:48,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:48,417 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:07:48,418 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:07:48,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:07:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:07:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:07:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 20:07:48,618 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 20:07:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:48,618 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 20:07:48,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 20:07:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:48,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:48,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:48,624 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:48,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1878869268, now seen corresponding path program 470 times [2020-02-10 20:07:48,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:48,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334932357] [2020-02-10 20:07:48,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:49,175 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:07:49,304 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:49,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:07:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334932357] [2020-02-10 20:07:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:49,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:49,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317770586] [2020-02-10 20:07:49,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:49,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:49,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:49,314 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:07:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:49,547 INFO L93 Difference]: Finished difference Result 6023 states and 26805 transitions. [2020-02-10 20:07:49,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:49,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:49,563 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:07:49,563 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:07:49,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:07:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3125. [2020-02-10 20:07:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:07:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15563 transitions. [2020-02-10 20:07:49,764 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15563 transitions. Word has length 31 [2020-02-10 20:07:49,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:49,764 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15563 transitions. [2020-02-10 20:07:49,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15563 transitions. [2020-02-10 20:07:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:49,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:49,769 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:49,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:49,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1249704454, now seen corresponding path program 471 times [2020-02-10 20:07:49,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:49,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650485905] [2020-02-10 20:07:49,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:50,314 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:07:50,447 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:50,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650485905] [2020-02-10 20:07:50,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:50,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:50,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682556835] [2020-02-10 20:07:50,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:50,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:50,456 INFO L87 Difference]: Start difference. First operand 3125 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:07:50,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:50,692 INFO L93 Difference]: Finished difference Result 6028 states and 26814 transitions. [2020-02-10 20:07:50,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:50,693 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:50,707 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:07:50,707 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:07:50,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:07:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 20:07:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:07:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15574 transitions. [2020-02-10 20:07:50,908 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15574 transitions. Word has length 31 [2020-02-10 20:07:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:50,908 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15574 transitions. [2020-02-10 20:07:50,908 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:50,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15574 transitions. [2020-02-10 20:07:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:50,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:50,913 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:50,914 INFO L82 PathProgramCache]: Analyzing trace with hash -757108692, now seen corresponding path program 472 times [2020-02-10 20:07:50,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:50,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602061400] [2020-02-10 20:07:50,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:51,464 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:07:51,590 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:07:51,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:07:51,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602061400] [2020-02-10 20:07:51,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:51,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:51,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715344447] [2020-02-10 20:07:51,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:51,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:51,600 INFO L87 Difference]: Start difference. First operand 3131 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:07:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:51,785 INFO L93 Difference]: Finished difference Result 6034 states and 26820 transitions. [2020-02-10 20:07:51,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:51,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:51,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:51,800 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:07:51,800 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:07:51,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:51,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:07:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 20:07:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:07:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 20:07:52,000 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 20:07:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:52,001 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 20:07:52,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:52,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 20:07:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:52,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:52,006 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:52,006 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:52,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:52,006 INFO L82 PathProgramCache]: Analyzing trace with hash 506697466, now seen corresponding path program 473 times [2020-02-10 20:07:52,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:52,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994858021] [2020-02-10 20:07:52,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:52,561 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:07:52,692 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:52,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:07:52,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994858021] [2020-02-10 20:07:52,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:52,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:52,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078984461] [2020-02-10 20:07:52,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:52,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:52,703 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:07:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:53,018 INFO L93 Difference]: Finished difference Result 6031 states and 26815 transitions. [2020-02-10 20:07:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:53,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:53,033 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:07:53,033 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:07:53,034 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:07:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3132. [2020-02-10 20:07:53,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:07:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15570 transitions. [2020-02-10 20:07:53,238 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15570 transitions. Word has length 31 [2020-02-10 20:07:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:53,239 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15570 transitions. [2020-02-10 20:07:53,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15570 transitions. [2020-02-10 20:07:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:53,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:53,244 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:53,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:53,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1605731164, now seen corresponding path program 474 times [2020-02-10 20:07:53,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:53,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840442041] [2020-02-10 20:07:53,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:53,807 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:53,942 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:53,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840442041] [2020-02-10 20:07:53,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:53,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:53,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599392267] [2020-02-10 20:07:53,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:53,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:53,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:53,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:53,952 INFO L87 Difference]: Start difference. First operand 3132 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:07:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:54,152 INFO L93 Difference]: Finished difference Result 6036 states and 26818 transitions. [2020-02-10 20:07:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:54,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:54,167 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:07:54,167 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:07:54,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:07:54,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 20:07:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:07:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15540 transitions. [2020-02-10 20:07:54,366 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15540 transitions. Word has length 31 [2020-02-10 20:07:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:54,366 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15540 transitions. [2020-02-10 20:07:54,366 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15540 transitions. [2020-02-10 20:07:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:54,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:54,371 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:54,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1726955480, now seen corresponding path program 475 times [2020-02-10 20:07:54,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:54,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942041400] [2020-02-10 20:07:54,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:54,925 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:55,055 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:55,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:07:55,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942041400] [2020-02-10 20:07:55,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:55,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:55,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833234613] [2020-02-10 20:07:55,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:55,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:55,064 INFO L87 Difference]: Start difference. First operand 3119 states and 15540 transitions. Second operand 12 states. [2020-02-10 20:07:55,318 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-02-10 20:07:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:55,335 INFO L93 Difference]: Finished difference Result 6043 states and 26851 transitions. [2020-02-10 20:07:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:55,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:55,351 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:07:55,352 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:07:55,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:07:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3133. [2020-02-10 20:07:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:07:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15579 transitions. [2020-02-10 20:07:55,554 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15579 transitions. Word has length 31 [2020-02-10 20:07:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:55,554 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15579 transitions. [2020-02-10 20:07:55,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15579 transitions. [2020-02-10 20:07:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:55,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:55,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:55,560 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:55,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:55,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1723040364, now seen corresponding path program 476 times [2020-02-10 20:07:55,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:55,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434653066] [2020-02-10 20:07:55,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:56,120 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:07:56,247 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:56,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:07:56,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434653066] [2020-02-10 20:07:56,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:56,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:56,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518752883] [2020-02-10 20:07:56,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:56,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:56,257 INFO L87 Difference]: Start difference. First operand 3133 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:07:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:56,498 INFO L93 Difference]: Finished difference Result 6040 states and 26839 transitions. [2020-02-10 20:07:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:56,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:56,513 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:07:56,513 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:07:56,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:07:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3127. [2020-02-10 20:07:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:07:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15562 transitions. [2020-02-10 20:07:56,720 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15562 transitions. Word has length 31 [2020-02-10 20:07:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:56,720 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15562 transitions. [2020-02-10 20:07:56,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15562 transitions. [2020-02-10 20:07:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:56,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:56,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:56,725 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1507233726, now seen corresponding path program 477 times [2020-02-10 20:07:56,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:56,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413247343] [2020-02-10 20:07:56,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:57,289 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:07:57,423 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:07:57,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:07:57,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413247343] [2020-02-10 20:07:57,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:57,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:57,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207148188] [2020-02-10 20:07:57,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:57,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:57,433 INFO L87 Difference]: Start difference. First operand 3127 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:07:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:57,716 INFO L93 Difference]: Finished difference Result 6053 states and 26866 transitions. [2020-02-10 20:07:57,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:57,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:57,731 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:07:57,731 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:07:57,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:07:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3138. [2020-02-10 20:07:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:07:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15582 transitions. [2020-02-10 20:07:57,930 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15582 transitions. Word has length 31 [2020-02-10 20:07:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:57,930 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15582 transitions. [2020-02-10 20:07:57,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15582 transitions. [2020-02-10 20:07:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:57,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:57,935 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:57,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:57,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1450166356, now seen corresponding path program 478 times [2020-02-10 20:07:57,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:57,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331068349] [2020-02-10 20:07:57,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:58,512 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:07:58,643 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:58,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:07:58,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331068349] [2020-02-10 20:07:58,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:58,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:58,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282350412] [2020-02-10 20:07:58,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:58,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:58,652 INFO L87 Difference]: Start difference. First operand 3138 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:07:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:07:58,872 INFO L93 Difference]: Finished difference Result 6055 states and 26860 transitions. [2020-02-10 20:07:58,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:07:58,873 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:07:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:07:58,887 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:07:58,888 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:07:58,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:07:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:07:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 20:07:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:07:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15554 transitions. [2020-02-10 20:07:59,092 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15554 transitions. Word has length 31 [2020-02-10 20:07:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:07:59,092 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15554 transitions. [2020-02-10 20:07:59,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:07:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15554 transitions. [2020-02-10 20:07:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:07:59,097 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:07:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:07:59,097 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:07:59,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:07:59,098 INFO L82 PathProgramCache]: Analyzing trace with hash 237951038, now seen corresponding path program 479 times [2020-02-10 20:07:59,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:07:59,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497884053] [2020-02-10 20:07:59,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:07:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:07:59,645 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:07:59,775 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:07:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:07:59,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497884053] [2020-02-10 20:07:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:07:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:07:59,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593466537] [2020-02-10 20:07:59,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:07:59,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:07:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:07:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:07:59,785 INFO L87 Difference]: Start difference. First operand 3127 states and 15554 transitions. Second operand 12 states. [2020-02-10 20:08:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:00,015 INFO L93 Difference]: Finished difference Result 6043 states and 26836 transitions. [2020-02-10 20:08:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:00,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:00,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:00,030 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:08:00,030 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:08:00,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:08:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3134. [2020-02-10 20:08:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:08:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15567 transitions. [2020-02-10 20:08:00,229 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15567 transitions. Word has length 31 [2020-02-10 20:08:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:00,229 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15567 transitions. [2020-02-10 20:08:00,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15567 transitions. [2020-02-10 20:08:00,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:00,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:00,234 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:00,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:00,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1874477592, now seen corresponding path program 480 times [2020-02-10 20:08:00,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:00,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316399009] [2020-02-10 20:08:00,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:00,795 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:08:00,926 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:08:00,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:08:00,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316399009] [2020-02-10 20:08:00,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:00,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:00,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450475276] [2020-02-10 20:08:00,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:00,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:00,936 INFO L87 Difference]: Start difference. First operand 3134 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:08:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:01,266 INFO L93 Difference]: Finished difference Result 6048 states and 26839 transitions. [2020-02-10 20:08:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:01,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:01,281 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:08:01,281 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:08:01,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:08:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3104. [2020-02-10 20:08:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:08:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15505 transitions. [2020-02-10 20:08:01,486 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15505 transitions. Word has length 31 [2020-02-10 20:08:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:01,486 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15505 transitions. [2020-02-10 20:08:01,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15505 transitions. [2020-02-10 20:08:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:01,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:01,491 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:01,491 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:01,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash 727124524, now seen corresponding path program 481 times [2020-02-10 20:08:01,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:01,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278578411] [2020-02-10 20:08:01,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:02,161 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:02,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278578411] [2020-02-10 20:08:02,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:02,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:02,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199111822] [2020-02-10 20:08:02,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:02,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:02,171 INFO L87 Difference]: Start difference. First operand 3104 states and 15505 transitions. Second operand 12 states. [2020-02-10 20:08:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:02,465 INFO L93 Difference]: Finished difference Result 5985 states and 26750 transitions. [2020-02-10 20:08:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:02,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:02,480 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:08:02,480 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:08:02,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:08:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3125. [2020-02-10 20:08:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:08:02,683 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:08:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:02,683 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:08:02,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:08:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:02,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:02,689 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash 304638798, now seen corresponding path program 482 times [2020-02-10 20:08:02,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:02,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952878535] [2020-02-10 20:08:02,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:03,220 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:03,349 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:03,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952878535] [2020-02-10 20:08:03,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:03,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:03,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420958745] [2020-02-10 20:08:03,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:03,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:03,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:03,358 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:08:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:03,709 INFO L93 Difference]: Finished difference Result 5982 states and 26739 transitions. [2020-02-10 20:08:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:03,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:03,724 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:08:03,724 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:08:03,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:08:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3120. [2020-02-10 20:08:03,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 20:08:03,971 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 20:08:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:03,972 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 20:08:03,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 20:08:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:03,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:03,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:03,977 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash -121497948, now seen corresponding path program 483 times [2020-02-10 20:08:03,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:03,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866584803] [2020-02-10 20:08:03,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:04,512 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:04,640 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:04,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866584803] [2020-02-10 20:08:04,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:04,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:04,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962239591] [2020-02-10 20:08:04,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:04,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:04,650 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:08:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:05,002 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 20:08:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:05,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:05,017 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:08:05,018 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:08:05,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:08:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3126. [2020-02-10 20:08:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:08:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:08:05,221 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:08:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:05,221 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:08:05,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:08:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:05,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:05,226 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:05,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:05,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2061040718, now seen corresponding path program 484 times [2020-02-10 20:08:05,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:05,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146538903] [2020-02-10 20:08:05,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:05,747 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:05,878 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:05,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:08:05,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146538903] [2020-02-10 20:08:05,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:05,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:05,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992040552] [2020-02-10 20:08:05,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:05,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:05,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:05,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:05,887 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:08:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:06,243 INFO L93 Difference]: Finished difference Result 5985 states and 26740 transitions. [2020-02-10 20:08:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:06,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:06,257 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:08:06,258 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:08:06,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:08:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3120. [2020-02-10 20:08:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:08:06,455 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:08:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:06,455 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:08:06,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:08:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:06,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:06,460 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:06,460 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:06,460 INFO L82 PathProgramCache]: Analyzing trace with hash -756139292, now seen corresponding path program 485 times [2020-02-10 20:08:06,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:06,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777406251] [2020-02-10 20:08:06,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:07,010 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:07,140 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:07,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:08:07,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777406251] [2020-02-10 20:08:07,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:07,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:07,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103536987] [2020-02-10 20:08:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:07,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:07,150 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:08:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:07,364 INFO L93 Difference]: Finished difference Result 5980 states and 26730 transitions. [2020-02-10 20:08:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:07,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:07,380 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:08:07,380 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:08:07,380 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:08:07,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 20:08:07,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15581 transitions. [2020-02-10 20:08:07,583 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15581 transitions. Word has length 31 [2020-02-10 20:08:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:07,584 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15581 transitions. [2020-02-10 20:08:07,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15581 transitions. [2020-02-10 20:08:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:07,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:07,589 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1848885100, now seen corresponding path program 486 times [2020-02-10 20:08:07,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:07,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290414932] [2020-02-10 20:08:07,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:08,129 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:08,258 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290414932] [2020-02-10 20:08:08,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:08,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:08,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637704982] [2020-02-10 20:08:08,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:08,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:08,268 INFO L87 Difference]: Start difference. First operand 3125 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:08:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:08,484 INFO L93 Difference]: Finished difference Result 5981 states and 26727 transitions. [2020-02-10 20:08:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:08,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:08,499 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:08:08,499 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:08:08,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:08,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:08:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3115. [2020-02-10 20:08:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:08:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15558 transitions. [2020-02-10 20:08:08,699 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15558 transitions. Word has length 31 [2020-02-10 20:08:08,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:08,699 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15558 transitions. [2020-02-10 20:08:08,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15558 transitions. [2020-02-10 20:08:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:08,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:08,704 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 458378096, now seen corresponding path program 487 times [2020-02-10 20:08:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:08,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603634613] [2020-02-10 20:08:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:09,252 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:09,383 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:09,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:08:09,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603634613] [2020-02-10 20:08:09,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:09,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:09,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031987265] [2020-02-10 20:08:09,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:09,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:09,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:09,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:09,393 INFO L87 Difference]: Start difference. First operand 3115 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:08:09,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:09,612 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 20:08:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:09,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:09,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:09,626 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:08:09,626 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:08:09,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:08:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3125. [2020-02-10 20:08:09,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 20:08:09,826 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 20:08:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:09,826 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 20:08:09,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 20:08:09,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:09,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:09,831 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:09,831 INFO L82 PathProgramCache]: Analyzing trace with hash 35892370, now seen corresponding path program 488 times [2020-02-10 20:08:09,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:09,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621048335] [2020-02-10 20:08:09,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:10,376 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:08:10,506 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:10,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621048335] [2020-02-10 20:08:10,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:10,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:10,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401499172] [2020-02-10 20:08:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:10,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:10,516 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:08:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:10,732 INFO L93 Difference]: Finished difference Result 5984 states and 26739 transitions. [2020-02-10 20:08:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:10,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:10,747 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:08:10,747 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:08:10,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:08:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3120. [2020-02-10 20:08:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:08:10,947 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:08:10,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:10,947 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:08:10,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:08:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:10,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:10,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:10,953 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash -814555612, now seen corresponding path program 489 times [2020-02-10 20:08:10,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:10,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174137884] [2020-02-10 20:08:10,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:11,506 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:11,641 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:11,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174137884] [2020-02-10 20:08:11,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:11,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:11,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582100801] [2020-02-10 20:08:11,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:11,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:11,651 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:08:11,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:11,876 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 20:08:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:11,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:11,891 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:08:11,891 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:08:11,892 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:08:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:08:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15585 transitions. [2020-02-10 20:08:12,096 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15585 transitions. Word has length 31 [2020-02-10 20:08:12,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:12,096 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15585 transitions. [2020-02-10 20:08:12,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15585 transitions. [2020-02-10 20:08:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:12,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:12,101 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:12,102 INFO L82 PathProgramCache]: Analyzing trace with hash 523011602, now seen corresponding path program 490 times [2020-02-10 20:08:12,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:12,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393150601] [2020-02-10 20:08:12,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:12,693 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:12,822 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:12,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:08:12,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393150601] [2020-02-10 20:08:12,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:12,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:12,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601938372] [2020-02-10 20:08:12,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:12,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:12,832 INFO L87 Difference]: Start difference. First operand 3127 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:08:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:13,050 INFO L93 Difference]: Finished difference Result 5990 states and 26746 transitions. [2020-02-10 20:08:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:13,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:13,065 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:08:13,065 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 20:08:13,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 20:08:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3120. [2020-02-10 20:08:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15567 transitions. [2020-02-10 20:08:13,269 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15567 transitions. Word has length 31 [2020-02-10 20:08:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:13,269 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15567 transitions. [2020-02-10 20:08:13,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15567 transitions. [2020-02-10 20:08:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:13,274 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:13,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:13,275 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:13,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1449196956, now seen corresponding path program 491 times [2020-02-10 20:08:13,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:13,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713634744] [2020-02-10 20:08:13,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:13,811 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:13,942 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:13,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:13,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713634744] [2020-02-10 20:08:13,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:13,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:13,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220567774] [2020-02-10 20:08:13,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:13,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:13,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:13,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:13,952 INFO L87 Difference]: Start difference. First operand 3120 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:08:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:14,170 INFO L93 Difference]: Finished difference Result 5983 states and 26732 transitions. [2020-02-10 20:08:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:14,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:14,185 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:08:14,185 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 20:08:14,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:14,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 20:08:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3125. [2020-02-10 20:08:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:08:14,386 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:08:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:14,386 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:08:14,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:08:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:14,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:14,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:14,391 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:14,391 INFO L82 PathProgramCache]: Analyzing trace with hash 310855984, now seen corresponding path program 492 times [2020-02-10 20:08:14,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:14,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914047606] [2020-02-10 20:08:14,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:14,926 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:15,059 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:15,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914047606] [2020-02-10 20:08:15,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:15,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:15,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739689278] [2020-02-10 20:08:15,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:15,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:15,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:15,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:15,069 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:08:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:15,335 INFO L93 Difference]: Finished difference Result 5985 states and 26731 transitions. [2020-02-10 20:08:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:15,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:15,350 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:08:15,350 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:08:15,350 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:08:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3115. [2020-02-10 20:08:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:08:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15553 transitions. [2020-02-10 20:08:15,555 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15553 transitions. Word has length 31 [2020-02-10 20:08:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:15,555 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15553 transitions. [2020-02-10 20:08:15,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15553 transitions. [2020-02-10 20:08:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:15,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:15,560 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:15,560 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash -927737232, now seen corresponding path program 493 times [2020-02-10 20:08:15,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:15,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319135258] [2020-02-10 20:08:15,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:16,100 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:16,230 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:16,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319135258] [2020-02-10 20:08:16,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:16,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:16,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376889397] [2020-02-10 20:08:16,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:16,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:16,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:16,241 INFO L87 Difference]: Start difference. First operand 3115 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:08:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:16,464 INFO L93 Difference]: Finished difference Result 5993 states and 26762 transitions. [2020-02-10 20:08:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:16,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:16,479 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:08:16,479 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:08:16,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:08:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 20:08:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:08:16,678 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:08:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:16,678 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:08:16,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:08:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:16,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:16,684 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:16,684 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1254801434, now seen corresponding path program 494 times [2020-02-10 20:08:16,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:16,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39090591] [2020-02-10 20:08:16,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:17,227 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:17,359 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:17,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39090591] [2020-02-10 20:08:17,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:17,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:17,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532767371] [2020-02-10 20:08:17,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:17,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:17,369 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:08:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:17,595 INFO L93 Difference]: Finished difference Result 5991 states and 26752 transitions. [2020-02-10 20:08:17,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:17,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:17,610 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:08:17,610 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:08:17,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:08:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:08:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:08:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:08:17,817 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:08:17,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:17,817 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:08:17,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:08:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:17,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:17,822 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1352048468, now seen corresponding path program 495 times [2020-02-10 20:08:17,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:17,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105020581] [2020-02-10 20:08:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:18,374 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:18,503 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:08:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:18,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105020581] [2020-02-10 20:08:18,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:18,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:18,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354038245] [2020-02-10 20:08:18,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:18,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:18,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:18,513 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:08:18,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:18,767 INFO L93 Difference]: Finished difference Result 5995 states and 26761 transitions. [2020-02-10 20:08:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:18,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:18,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:18,782 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:08:18,782 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:08:18,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:08:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 20:08:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:08:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:08:18,987 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:08:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:18,987 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:08:18,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:18,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:08:18,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:18,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:18,992 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash -14481254, now seen corresponding path program 496 times [2020-02-10 20:08:18,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:18,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584495579] [2020-02-10 20:08:18,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:19,543 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:19,676 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:19,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:08:19,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584495579] [2020-02-10 20:08:19,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:19,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:19,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651095242] [2020-02-10 20:08:19,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:19,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:19,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:19,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:19,685 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:08:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:19,918 INFO L93 Difference]: Finished difference Result 5994 states and 26752 transitions. [2020-02-10 20:08:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:19,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:19,933 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:08:19,933 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:08:19,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:08:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:08:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:08:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15564 transitions. [2020-02-10 20:08:20,136 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15564 transitions. Word has length 31 [2020-02-10 20:08:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:20,136 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15564 transitions. [2020-02-10 20:08:20,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15564 transitions. [2020-02-10 20:08:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:20,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:20,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:20,142 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash -230287892, now seen corresponding path program 497 times [2020-02-10 20:08:20,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:20,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766691139] [2020-02-10 20:08:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:20,700 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:20,831 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:20,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766691139] [2020-02-10 20:08:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872622637] [2020-02-10 20:08:20,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:20,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:20,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:20,841 INFO L87 Difference]: Start difference. First operand 3121 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:08:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:21,067 INFO L93 Difference]: Finished difference Result 5990 states and 26744 transitions. [2020-02-10 20:08:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:21,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:21,082 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:08:21,082 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:08:21,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:08:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3127. [2020-02-10 20:08:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15575 transitions. [2020-02-10 20:08:21,326 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15575 transitions. Word has length 31 [2020-02-10 20:08:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:21,326 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15575 transitions. [2020-02-10 20:08:21,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15575 transitions. [2020-02-10 20:08:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:21,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:21,331 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:21,331 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:21,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1075259344, now seen corresponding path program 498 times [2020-02-10 20:08:21,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:21,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501754645] [2020-02-10 20:08:21,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:21,881 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:22,014 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:22,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:08:22,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501754645] [2020-02-10 20:08:22,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:22,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:22,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928221610] [2020-02-10 20:08:22,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:22,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:22,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:22,025 INFO L87 Difference]: Start difference. First operand 3127 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:08:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:22,252 INFO L93 Difference]: Finished difference Result 5991 states and 26740 transitions. [2020-02-10 20:08:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:22,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:22,267 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:08:22,267 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:08:22,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:22,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:08:22,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3115. [2020-02-10 20:08:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:08:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15548 transitions. [2020-02-10 20:08:22,467 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15548 transitions. Word has length 31 [2020-02-10 20:08:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:22,467 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15548 transitions. [2020-02-10 20:08:22,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:22,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15548 transitions. [2020-02-10 20:08:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:22,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:22,472 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 450731858, now seen corresponding path program 499 times [2020-02-10 20:08:22,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:22,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577165716] [2020-02-10 20:08:22,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:23,017 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:23,147 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:08:23,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:08:23,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577165716] [2020-02-10 20:08:23,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:23,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:23,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025320027] [2020-02-10 20:08:23,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:23,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:23,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:23,157 INFO L87 Difference]: Start difference. First operand 3115 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:08:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:23,410 INFO L93 Difference]: Finished difference Result 5979 states and 26723 transitions. [2020-02-10 20:08:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:23,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:23,424 INFO L225 Difference]: With dead ends: 5979 [2020-02-10 20:08:23,425 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:08:23,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:08:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3125. [2020-02-10 20:08:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:08:23,624 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:08:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:23,624 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:08:23,624 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:08:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:23,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:23,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:23,629 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:23,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:23,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1239211046, now seen corresponding path program 500 times [2020-02-10 20:08:23,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:23,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299892890] [2020-02-10 20:08:23,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:24,182 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:24,313 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:24,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:08:24,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299892890] [2020-02-10 20:08:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:24,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957500792] [2020-02-10 20:08:24,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:24,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:24,322 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:08:24,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:24,550 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 20:08:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:24,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:24,565 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:08:24,565 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:08:24,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:08:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3120. [2020-02-10 20:08:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 20:08:24,762 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 20:08:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:24,762 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 20:08:24,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:24,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 20:08:24,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:24,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:24,767 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash 26420622, now seen corresponding path program 501 times [2020-02-10 20:08:24,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:24,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680218584] [2020-02-10 20:08:24,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:25,313 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:25,446 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:25,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680218584] [2020-02-10 20:08:25,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:25,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:25,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145672591] [2020-02-10 20:08:25,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:25,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:25,457 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:08:25,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:25,761 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 20:08:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:25,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:25,776 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:08:25,776 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:08:25,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:08:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 20:08:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:08:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:08:25,975 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:08:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:25,975 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:08:25,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:08:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:25,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:25,981 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1786473562, now seen corresponding path program 502 times [2020-02-10 20:08:25,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:25,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843905671] [2020-02-10 20:08:25,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:26,535 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:26,668 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:26,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843905671] [2020-02-10 20:08:26,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:26,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:26,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98037631] [2020-02-10 20:08:26,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:26,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:26,678 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:08:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:26,966 INFO L93 Difference]: Finished difference Result 5982 states and 26719 transitions. [2020-02-10 20:08:26,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:26,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:26,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:26,982 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:08:26,982 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:08:26,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:08:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3120. [2020-02-10 20:08:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:08:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15557 transitions. [2020-02-10 20:08:27,184 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15557 transitions. Word has length 31 [2020-02-10 20:08:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:27,184 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15557 transitions. [2020-02-10 20:08:27,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15557 transitions. [2020-02-10 20:08:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:27,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:27,189 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1782822542, now seen corresponding path program 503 times [2020-02-10 20:08:27,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:27,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226389343] [2020-02-10 20:08:27,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:27,743 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:27,875 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:27,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226389343] [2020-02-10 20:08:27,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:27,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:27,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173829486] [2020-02-10 20:08:27,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:27,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:27,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:27,886 INFO L87 Difference]: Start difference. First operand 3120 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:08:28,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:28,197 INFO L93 Difference]: Finished difference Result 5983 states and 26722 transitions. [2020-02-10 20:08:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:28,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:28,212 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:08:28,212 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:08:28,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:28,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:08:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3126. [2020-02-10 20:08:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:08:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 20:08:28,420 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 20:08:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:28,421 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 20:08:28,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 20:08:28,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:28,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:28,426 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:28,426 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:28,427 INFO L82 PathProgramCache]: Analyzing trace with hash 937851090, now seen corresponding path program 504 times [2020-02-10 20:08:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:28,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728174269] [2020-02-10 20:08:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:28,982 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:29,111 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:08:29,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:08:29,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728174269] [2020-02-10 20:08:29,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:29,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:29,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715114769] [2020-02-10 20:08:29,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:29,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:29,122 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:08:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:29,373 INFO L93 Difference]: Finished difference Result 5984 states and 26718 transitions. [2020-02-10 20:08:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:29,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:29,388 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:08:29,388 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:08:29,389 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:08:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3110. [2020-02-10 20:08:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:08:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15534 transitions. [2020-02-10 20:08:29,587 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15534 transitions. Word has length 31 [2020-02-10 20:08:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:29,588 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15534 transitions. [2020-02-10 20:08:29,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15534 transitions. [2020-02-10 20:08:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:29,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:29,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:29,593 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:29,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:29,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1032166138, now seen corresponding path program 505 times [2020-02-10 20:08:29,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:29,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871862750] [2020-02-10 20:08:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:30,186 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:08:30,318 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:30,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871862750] [2020-02-10 20:08:30,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:30,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:30,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126094730] [2020-02-10 20:08:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:30,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:30,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:30,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:30,328 INFO L87 Difference]: Start difference. First operand 3110 states and 15534 transitions. Second operand 12 states. [2020-02-10 20:08:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:30,644 INFO L93 Difference]: Finished difference Result 5997 states and 26774 transitions. [2020-02-10 20:08:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:30,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:30,659 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:08:30,659 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:08:30,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:08:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3126. [2020-02-10 20:08:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:08:30,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15590 transitions. [2020-02-10 20:08:30,864 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15590 transitions. Word has length 31 [2020-02-10 20:08:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:30,864 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15590 transitions. [2020-02-10 20:08:30,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15590 transitions. [2020-02-10 20:08:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:30,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:30,870 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1454651864, now seen corresponding path program 506 times [2020-02-10 20:08:30,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:30,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052970986] [2020-02-10 20:08:30,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:31,410 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:31,539 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:31,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052970986] [2020-02-10 20:08:31,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:31,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:31,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401295908] [2020-02-10 20:08:31,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:31,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:31,549 INFO L87 Difference]: Start difference. First operand 3126 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:08:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:31,794 INFO L93 Difference]: Finished difference Result 5994 states and 26763 transitions. [2020-02-10 20:08:31,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:31,795 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:31,809 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:08:31,809 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:08:31,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:08:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3121. [2020-02-10 20:08:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:08:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 20:08:32,015 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 20:08:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:32,015 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 20:08:32,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 20:08:32,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:32,020 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:32,021 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:32,021 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1880788610, now seen corresponding path program 507 times [2020-02-10 20:08:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:32,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833177714] [2020-02-10 20:08:32,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:32,549 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:32,678 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:32,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833177714] [2020-02-10 20:08:32,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:32,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:32,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611526148] [2020-02-10 20:08:32,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:32,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:32,688 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:08:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:32,945 INFO L93 Difference]: Finished difference Result 5999 states and 26774 transitions. [2020-02-10 20:08:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:32,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:32,961 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:08:32,961 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:08:32,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:33,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:08:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 20:08:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:08:33,163 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:08:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:33,163 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:08:33,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:08:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:33,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:33,168 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 301750056, now seen corresponding path program 508 times [2020-02-10 20:08:33,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:33,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144708600] [2020-02-10 20:08:33,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:33,692 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:33,822 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:33,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:08:33,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144708600] [2020-02-10 20:08:33,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:33,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:33,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096821135] [2020-02-10 20:08:33,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:33,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:33,832 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:08:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:34,105 INFO L93 Difference]: Finished difference Result 5997 states and 26764 transitions. [2020-02-10 20:08:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:34,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:34,121 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:08:34,121 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:08:34,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:08:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 20:08:34,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:08:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15571 transitions. [2020-02-10 20:08:34,326 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15571 transitions. Word has length 31 [2020-02-10 20:08:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:34,326 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15571 transitions. [2020-02-10 20:08:34,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15571 transitions. [2020-02-10 20:08:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:34,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:34,332 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1779537342, now seen corresponding path program 509 times [2020-02-10 20:08:34,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:34,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752873197] [2020-02-10 20:08:34,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:34,871 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:35,005 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:35,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752873197] [2020-02-10 20:08:35,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:35,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:35,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003642920] [2020-02-10 20:08:35,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:35,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:35,015 INFO L87 Difference]: Start difference. First operand 3121 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:08:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:35,246 INFO L93 Difference]: Finished difference Result 5992 states and 26754 transitions. [2020-02-10 20:08:35,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:35,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:35,261 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:08:35,261 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:08:35,262 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:08:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-02-10 20:08:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:08:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15580 transitions. [2020-02-10 20:08:35,466 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15580 transitions. Word has length 31 [2020-02-10 20:08:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:35,466 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15580 transitions. [2020-02-10 20:08:35,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15580 transitions. [2020-02-10 20:08:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:35,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:35,471 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:35,471 INFO L82 PathProgramCache]: Analyzing trace with hash 89594438, now seen corresponding path program 510 times [2020-02-10 20:08:35,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:35,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696439653] [2020-02-10 20:08:35,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:36,008 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:36,139 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:36,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:08:36,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696439653] [2020-02-10 20:08:36,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:36,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:36,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291882121] [2020-02-10 20:08:36,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:36,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:36,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:36,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:36,149 INFO L87 Difference]: Start difference. First operand 3126 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:08:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:36,383 INFO L93 Difference]: Finished difference Result 5993 states and 26751 transitions. [2020-02-10 20:08:36,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:36,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:36,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:36,398 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:08:36,398 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:08:36,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:08:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3116. [2020-02-10 20:08:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:08:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15557 transitions. [2020-02-10 20:08:36,597 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15557 transitions. Word has length 31 [2020-02-10 20:08:36,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:36,597 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15557 transitions. [2020-02-10 20:08:36,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:36,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15557 transitions. [2020-02-10 20:08:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:36,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:36,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:36,602 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:36,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash 443451440, now seen corresponding path program 511 times [2020-02-10 20:08:36,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:36,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007575862] [2020-02-10 20:08:36,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:37,129 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:08:37,261 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:37,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:08:37,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007575862] [2020-02-10 20:08:37,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:37,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:37,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404477542] [2020-02-10 20:08:37,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:37,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:37,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:37,271 INFO L87 Difference]: Start difference. First operand 3116 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:08:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:37,501 INFO L93 Difference]: Finished difference Result 6007 states and 26791 transitions. [2020-02-10 20:08:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:37,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:37,516 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:08:37,516 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:08:37,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:08:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3127. [2020-02-10 20:08:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 20:08:37,723 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 20:08:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:37,723 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 20:08:37,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 20:08:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:37,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:37,728 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:37,728 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:37,728 INFO L82 PathProgramCache]: Analyzing trace with hash 20965714, now seen corresponding path program 512 times [2020-02-10 20:08:37,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:37,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114713151] [2020-02-10 20:08:37,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:38,264 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:38,397 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:38,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:08:38,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114713151] [2020-02-10 20:08:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:38,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:38,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607133763] [2020-02-10 20:08:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:38,407 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:08:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:38,733 INFO L93 Difference]: Finished difference Result 6004 states and 26780 transitions. [2020-02-10 20:08:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:38,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:38,748 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:08:38,748 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:08:38,748 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:08:38,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 20:08:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:08:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15574 transitions. [2020-02-10 20:08:38,990 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15574 transitions. Word has length 31 [2020-02-10 20:08:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:38,990 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15574 transitions. [2020-02-10 20:08:38,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15574 transitions. [2020-02-10 20:08:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:38,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:38,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:38,995 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1465949122, now seen corresponding path program 513 times [2020-02-10 20:08:38,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:38,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538252225] [2020-02-10 20:08:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:39,529 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:08:39,657 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:39,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:08:39,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538252225] [2020-02-10 20:08:39,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:39,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:39,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299532076] [2020-02-10 20:08:39,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:39,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:39,667 INFO L87 Difference]: Start difference. First operand 3122 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:08:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:39,943 INFO L93 Difference]: Finished difference Result 6017 states and 26808 transitions. [2020-02-10 20:08:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:39,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:39,959 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:08:39,959 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:08:39,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:08:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3131. [2020-02-10 20:08:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:08:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 20:08:40,158 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 20:08:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:40,158 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 20:08:40,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 20:08:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:40,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:40,164 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1395839086, now seen corresponding path program 514 times [2020-02-10 20:08:40,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:40,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93711004] [2020-02-10 20:08:40,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:40,703 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:08:40,833 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:40,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93711004] [2020-02-10 20:08:40,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:40,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:40,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100308108] [2020-02-10 20:08:40,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:40,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:40,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:40,843 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:08:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:41,044 INFO L93 Difference]: Finished difference Result 6020 states and 26805 transitions. [2020-02-10 20:08:41,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:41,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:41,059 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:08:41,059 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:08:41,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:08:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3122. [2020-02-10 20:08:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:08:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:08:41,263 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:08:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:41,263 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:08:41,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:41,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:08:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:41,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:41,268 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:41,268 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2100590466, now seen corresponding path program 515 times [2020-02-10 20:08:41,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:41,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887853106] [2020-02-10 20:08:41,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:41,794 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:41,925 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:41,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887853106] [2020-02-10 20:08:41,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:41,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:41,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982640035] [2020-02-10 20:08:41,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:41,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:41,934 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:08:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:42,225 INFO L93 Difference]: Finished difference Result 6008 states and 26781 transitions. [2020-02-10 20:08:42,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:42,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:42,240 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:08:42,240 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:08:42,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:08:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3128. [2020-02-10 20:08:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:08:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 20:08:42,443 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 20:08:42,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:42,443 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 20:08:42,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 20:08:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:42,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:42,449 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1607994704, now seen corresponding path program 516 times [2020-02-10 20:08:42,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:42,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825832270] [2020-02-10 20:08:42,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:42,980 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:08:43,112 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:43,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:08:43,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825832270] [2020-02-10 20:08:43,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:43,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:43,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354505336] [2020-02-10 20:08:43,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:43,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:43,121 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:08:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:43,332 INFO L93 Difference]: Finished difference Result 6014 states and 26787 transitions. [2020-02-10 20:08:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:43,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:43,347 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:08:43,347 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:08:43,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:08:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3116. [2020-02-10 20:08:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:08:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 20:08:43,550 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 20:08:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:43,550 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 20:08:43,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 20:08:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:43,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:43,556 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:43,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:43,556 INFO L82 PathProgramCache]: Analyzing trace with hash -942663888, now seen corresponding path program 517 times [2020-02-10 20:08:43,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:43,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679331755] [2020-02-10 20:08:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:44,088 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:44,219 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:44,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679331755] [2020-02-10 20:08:44,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:44,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:44,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888650620] [2020-02-10 20:08:44,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:44,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:44,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:44,230 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:08:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:44,466 INFO L93 Difference]: Finished difference Result 6013 states and 26802 transitions. [2020-02-10 20:08:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:44,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:44,481 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 20:08:44,481 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:08:44,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:08:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3129. [2020-02-10 20:08:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:08:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:08:44,681 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:08:44,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:44,681 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:08:44,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:08:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:44,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:44,686 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1239874778, now seen corresponding path program 518 times [2020-02-10 20:08:44,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:44,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148506549] [2020-02-10 20:08:44,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:45,215 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:45,349 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:45,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148506549] [2020-02-10 20:08:45,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:45,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:45,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102652622] [2020-02-10 20:08:45,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:45,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:45,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:45,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:45,359 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:08:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:45,599 INFO L93 Difference]: Finished difference Result 6011 states and 26792 transitions. [2020-02-10 20:08:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:45,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:45,614 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:08:45,614 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:08:45,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:08:45,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3123. [2020-02-10 20:08:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:08:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15571 transitions. [2020-02-10 20:08:45,820 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15571 transitions. Word has length 31 [2020-02-10 20:08:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:45,820 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15571 transitions. [2020-02-10 20:08:45,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15571 transitions. [2020-02-10 20:08:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:45,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:45,825 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2003441978, now seen corresponding path program 519 times [2020-02-10 20:08:45,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:45,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707722972] [2020-02-10 20:08:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:46,356 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:08:46,487 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:46,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:08:46,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707722972] [2020-02-10 20:08:46,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:46,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:46,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480717205] [2020-02-10 20:08:46,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:46,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:46,496 INFO L87 Difference]: Start difference. First operand 3123 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:08:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:46,752 INFO L93 Difference]: Finished difference Result 6021 states and 26813 transitions. [2020-02-10 20:08:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:46,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:46,767 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:08:46,767 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:08:46,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:08:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3132. [2020-02-10 20:08:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:08:46,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15588 transitions. [2020-02-10 20:08:46,972 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15588 transitions. Word has length 31 [2020-02-10 20:08:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:46,972 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15588 transitions. [2020-02-10 20:08:46,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15588 transitions. [2020-02-10 20:08:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:46,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:46,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:46,978 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:46,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1933331942, now seen corresponding path program 520 times [2020-02-10 20:08:46,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:46,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572889085] [2020-02-10 20:08:46,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:47,524 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:08:47,658 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:47,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572889085] [2020-02-10 20:08:47,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:47,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:47,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285983771] [2020-02-10 20:08:47,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:47,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:47,713 INFO L87 Difference]: Start difference. First operand 3132 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:08:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:47,960 INFO L93 Difference]: Finished difference Result 6024 states and 26810 transitions. [2020-02-10 20:08:47,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:47,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:47,975 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:08:47,975 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:08:47,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:08:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 20:08:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:08:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15564 transitions. [2020-02-10 20:08:48,176 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15564 transitions. Word has length 31 [2020-02-10 20:08:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:48,176 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15564 transitions. [2020-02-10 20:08:48,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15564 transitions. [2020-02-10 20:08:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:48,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:48,181 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash -881681402, now seen corresponding path program 521 times [2020-02-10 20:08:48,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:48,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382328870] [2020-02-10 20:08:48,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:48,709 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:48,841 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:48,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:08:48,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382328870] [2020-02-10 20:08:48,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:48,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:48,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046928733] [2020-02-10 20:08:48,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:48,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:48,852 INFO L87 Difference]: Start difference. First operand 3123 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:08:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:49,115 INFO L93 Difference]: Finished difference Result 6015 states and 26792 transitions. [2020-02-10 20:08:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:49,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:49,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:49,131 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:08:49,131 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:08:49,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:08:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 20:08:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:08:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 20:08:49,332 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 20:08:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:49,332 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 20:08:49,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 20:08:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:49,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:49,337 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:49,337 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1300857264, now seen corresponding path program 522 times [2020-02-10 20:08:49,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:49,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152798711] [2020-02-10 20:08:49,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:49,881 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:08:50,009 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:50,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:08:50,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152798711] [2020-02-10 20:08:50,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:50,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:50,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875541447] [2020-02-10 20:08:50,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:50,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:50,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:50,019 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:08:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:50,300 INFO L93 Difference]: Finished difference Result 6020 states and 26795 transitions. [2020-02-10 20:08:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:50,300 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:50,315 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:08:50,315 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:08:50,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:50,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:08:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 20:08:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:08:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 20:08:50,518 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 20:08:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:50,518 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 20:08:50,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 20:08:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:50,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:50,524 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:50,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash 435805202, now seen corresponding path program 523 times [2020-02-10 20:08:50,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:50,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050418721] [2020-02-10 20:08:50,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:51,063 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:51,195 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:51,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:08:51,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050418721] [2020-02-10 20:08:51,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:51,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:51,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308319933] [2020-02-10 20:08:51,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:51,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:51,205 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 20:08:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:51,467 INFO L93 Difference]: Finished difference Result 5998 states and 26759 transitions. [2020-02-10 20:08:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:51,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:51,482 INFO L225 Difference]: With dead ends: 5998 [2020-02-10 20:08:51,482 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:08:51,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:08:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3127. [2020-02-10 20:08:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:08:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 20:08:51,688 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 20:08:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:51,688 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 20:08:51,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 20:08:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:51,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:51,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:51,693 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1254137702, now seen corresponding path program 524 times [2020-02-10 20:08:51,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:51,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098987342] [2020-02-10 20:08:51,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:52,229 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:52,358 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:52,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:08:52,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098987342] [2020-02-10 20:08:52,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:52,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:52,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891297662] [2020-02-10 20:08:52,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:52,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:52,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:52,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:52,368 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:08:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:52,722 INFO L93 Difference]: Finished difference Result 5999 states and 26756 transitions. [2020-02-10 20:08:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:52,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:52,737 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:08:52,738 INFO L226 Difference]: Without dead ends: 5977 [2020-02-10 20:08:52,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2020-02-10 20:08:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 3122. [2020-02-10 20:08:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:08:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 20:08:52,941 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 20:08:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:52,942 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 20:08:52,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 20:08:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:52,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:52,947 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:52,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash -624972888, now seen corresponding path program 525 times [2020-02-10 20:08:52,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:52,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903833734] [2020-02-10 20:08:52,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:53,471 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:08:53,601 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:53,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903833734] [2020-02-10 20:08:53,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:53,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:53,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550526280] [2020-02-10 20:08:53,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:53,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:53,611 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:08:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:53,970 INFO L93 Difference]: Finished difference Result 6004 states and 26765 transitions. [2020-02-10 20:08:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:53,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:53,984 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:08:53,984 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:08:53,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:08:54,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:08:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:08:54,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:08:54,189 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:08:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:54,189 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:08:54,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:08:54,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:54,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:54,194 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:54,194 INFO L82 PathProgramCache]: Analyzing trace with hash -132377126, now seen corresponding path program 526 times [2020-02-10 20:08:54,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:54,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732122307] [2020-02-10 20:08:54,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:54,726 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:08:54,854 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:08:54,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:08:54,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732122307] [2020-02-10 20:08:54,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:54,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:54,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605543660] [2020-02-10 20:08:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:54,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:54,864 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:08:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:55,182 INFO L93 Difference]: Finished difference Result 6010 states and 26771 transitions. [2020-02-10 20:08:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:55,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:55,197 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:08:55,197 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:08:55,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:08:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:08:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:08:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:08:55,396 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:08:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:55,397 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:08:55,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:08:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:55,402 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:55,402 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1131429032, now seen corresponding path program 527 times [2020-02-10 20:08:55,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:55,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033593515] [2020-02-10 20:08:55,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:55,939 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:08:56,066 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:56,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:08:56,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033593515] [2020-02-10 20:08:56,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:56,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:56,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832200270] [2020-02-10 20:08:56,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:56,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:56,075 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:08:56,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:56,435 INFO L93 Difference]: Finished difference Result 6007 states and 26766 transitions. [2020-02-10 20:08:56,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:56,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:56,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:56,449 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:08:56,449 INFO L226 Difference]: Without dead ends: 5990 [2020-02-10 20:08:56,449 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-02-10 20:08:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 3129. [2020-02-10 20:08:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:08:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15569 transitions. [2020-02-10 20:08:56,707 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15569 transitions. Word has length 31 [2020-02-10 20:08:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:56,707 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15569 transitions. [2020-02-10 20:08:56,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15569 transitions. [2020-02-10 20:08:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:56,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:56,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:56,712 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:56,713 INFO L82 PathProgramCache]: Analyzing trace with hash -980999598, now seen corresponding path program 528 times [2020-02-10 20:08:56,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:56,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611236241] [2020-02-10 20:08:56,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:57,252 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:08:57,377 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:57,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611236241] [2020-02-10 20:08:57,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:57,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:57,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635897147] [2020-02-10 20:08:57,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:57,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:57,388 INFO L87 Difference]: Start difference. First operand 3129 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:08:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:57,593 INFO L93 Difference]: Finished difference Result 6012 states and 26769 transitions. [2020-02-10 20:08:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:57,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:57,608 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:08:57,608 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:08:57,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:08:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3110. [2020-02-10 20:08:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:08:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15528 transitions. [2020-02-10 20:08:57,809 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15528 transitions. Word has length 31 [2020-02-10 20:08:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:57,809 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15528 transitions. [2020-02-10 20:08:57,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15528 transitions. [2020-02-10 20:08:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:57,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:57,814 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:57,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1042117242, now seen corresponding path program 529 times [2020-02-10 20:08:57,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:57,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916365057] [2020-02-10 20:08:57,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:58,347 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:08:58,482 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:58,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916365057] [2020-02-10 20:08:58,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:58,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:58,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115282992] [2020-02-10 20:08:58,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:58,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:58,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:58,491 INFO L87 Difference]: Start difference. First operand 3110 states and 15528 transitions. Second operand 12 states. [2020-02-10 20:08:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:58,707 INFO L93 Difference]: Finished difference Result 6003 states and 26785 transitions. [2020-02-10 20:08:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:58,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:58,722 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:08:58,723 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:08:58,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:08:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:08:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3126. [2020-02-10 20:08:58,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:08:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:08:58,927 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:08:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:08:58,927 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:08:58,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:08:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:08:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:08:58,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:08:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:08:58,933 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:08:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:08:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1464602968, now seen corresponding path program 530 times [2020-02-10 20:08:58,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:08:58,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50169840] [2020-02-10 20:08:58,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:08:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:08:59,479 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:08:59,618 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:08:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:08:59,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50169840] [2020-02-10 20:08:59,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:08:59,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:08:59,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101982805] [2020-02-10 20:08:59,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:08:59,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:08:59,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:08:59,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:08:59,630 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:08:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:08:59,861 INFO L93 Difference]: Finished difference Result 6000 states and 26774 transitions. [2020-02-10 20:08:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:08:59,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:08:59,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:08:59,876 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:08:59,876 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:08:59,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:09:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3121. [2020-02-10 20:09:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:09:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:09:00,075 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:09:00,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:00,075 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:09:00,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:09:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:00,080 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:00,080 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:00,080 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:00,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1979916346, now seen corresponding path program 531 times [2020-02-10 20:09:00,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:00,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638283959] [2020-02-10 20:09:00,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:00,615 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:00,745 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:00,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:09:00,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638283959] [2020-02-10 20:09:00,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:00,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:00,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188703557] [2020-02-10 20:09:00,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:00,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:00,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:00,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:00,755 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:09:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:00,973 INFO L93 Difference]: Finished difference Result 6007 states and 26790 transitions. [2020-02-10 20:09:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:00,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:00,988 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:09:00,989 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:09:00,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:09:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:09:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:09:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:09:01,193 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:09:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:01,194 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:09:01,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:09:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:01,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:01,199 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash -977483736, now seen corresponding path program 532 times [2020-02-10 20:09:01,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:01,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967237053] [2020-02-10 20:09:01,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:01,731 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:01,862 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:01,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:09:01,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967237053] [2020-02-10 20:09:01,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:01,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:01,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826084759] [2020-02-10 20:09:01,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:01,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:01,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:01,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:01,871 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:09:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:02,092 INFO L93 Difference]: Finished difference Result 6006 states and 26781 transitions. [2020-02-10 20:09:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:02,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:02,107 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:09:02,107 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:09:02,107 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:09:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3121. [2020-02-10 20:09:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:09:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-02-10 20:09:02,306 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-02-10 20:09:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:02,306 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-02-10 20:09:02,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-02-10 20:09:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:02,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:02,311 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1345275002, now seen corresponding path program 533 times [2020-02-10 20:09:02,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:02,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284591894] [2020-02-10 20:09:02,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:02,846 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:02,975 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:02,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284591894] [2020-02-10 20:09:02,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:02,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:02,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623073008] [2020-02-10 20:09:02,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:02,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:02,985 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:09:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:03,252 INFO L93 Difference]: Finished difference Result 5999 states and 26767 transitions. [2020-02-10 20:09:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:03,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:03,265 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:09:03,266 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:09:03,266 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:09:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3126. [2020-02-10 20:09:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:09:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15574 transitions. [2020-02-10 20:09:03,465 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15574 transitions. Word has length 31 [2020-02-10 20:09:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:03,465 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15574 transitions. [2020-02-10 20:09:03,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15574 transitions. [2020-02-10 20:09:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:03,470 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:03,471 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1189639354, now seen corresponding path program 534 times [2020-02-10 20:09:03,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:03,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555349171] [2020-02-10 20:09:03,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:03,988 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:04,120 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:04,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:09:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555349171] [2020-02-10 20:09:04,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:04,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:04,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113596913] [2020-02-10 20:09:04,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:04,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:04,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:04,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:04,130 INFO L87 Difference]: Start difference. First operand 3126 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:09:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:04,358 INFO L93 Difference]: Finished difference Result 6001 states and 26766 transitions. [2020-02-10 20:09:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:04,359 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:04,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:04,373 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:09:04,373 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:09:04,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:09:04,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3116. [2020-02-10 20:09:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:09:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 20:09:04,574 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 20:09:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:04,574 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 20:09:04,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 20:09:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:04,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:04,579 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:04,579 INFO L82 PathProgramCache]: Analyzing trace with hash 702246764, now seen corresponding path program 535 times [2020-02-10 20:09:04,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:04,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101130079] [2020-02-10 20:09:04,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:05,111 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:05,238 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:05,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:09:05,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101130079] [2020-02-10 20:09:05,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:05,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:05,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367800099] [2020-02-10 20:09:05,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:05,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:05,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:05,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:05,248 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:09:05,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:05,551 INFO L93 Difference]: Finished difference Result 6011 states and 26797 transitions. [2020-02-10 20:09:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:05,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:05,566 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:09:05,567 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:09:05,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:09:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 20:09:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:09:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 20:09:05,769 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 20:09:05,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:05,770 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 20:09:05,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:05,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 20:09:05,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:05,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:05,775 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 279761038, now seen corresponding path program 536 times [2020-02-10 20:09:05,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:05,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218627330] [2020-02-10 20:09:05,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:06,302 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:09:06,431 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:06,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:09:06,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218627330] [2020-02-10 20:09:06,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:06,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:06,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972689854] [2020-02-10 20:09:06,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:06,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:06,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:06,440 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:09:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:06,666 INFO L93 Difference]: Finished difference Result 6008 states and 26786 transitions. [2020-02-10 20:09:06,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:06,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:06,682 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:09:06,682 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:09:06,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:09:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 20:09:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:09:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:09:06,883 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:09:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:06,883 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:09:06,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:09:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:06,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:06,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:06,889 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1207153798, now seen corresponding path program 537 times [2020-02-10 20:09:06,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:06,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284021065] [2020-02-10 20:09:06,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:07,419 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:07,546 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:07,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:09:07,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284021065] [2020-02-10 20:09:07,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:07,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:07,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587605965] [2020-02-10 20:09:07,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:07,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:07,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:07,557 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:09:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:07,854 INFO L93 Difference]: Finished difference Result 6021 states and 26814 transitions. [2020-02-10 20:09:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:07,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:07,868 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:09:07,868 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:09:07,868 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:09:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3131. [2020-02-10 20:09:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:09:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15585 transitions. [2020-02-10 20:09:08,067 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15585 transitions. Word has length 31 [2020-02-10 20:09:08,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:08,068 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15585 transitions. [2020-02-10 20:09:08,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15585 transitions. [2020-02-10 20:09:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:08,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:08,073 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1137043762, now seen corresponding path program 538 times [2020-02-10 20:09:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:08,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947555791] [2020-02-10 20:09:08,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:08,619 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:09:08,749 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:08,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:09:08,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947555791] [2020-02-10 20:09:08,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:08,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:08,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828147574] [2020-02-10 20:09:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:08,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:08,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:08,759 INFO L87 Difference]: Start difference. First operand 3131 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:09:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:08,947 INFO L93 Difference]: Finished difference Result 6024 states and 26811 transitions. [2020-02-10 20:09:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:08,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:08,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:08,963 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:09:08,963 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:09:08,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:09:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3122. [2020-02-10 20:09:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:09:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 20:09:09,168 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 20:09:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:09,169 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 20:09:09,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 20:09:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:09,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:09,174 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:09,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1841795142, now seen corresponding path program 539 times [2020-02-10 20:09:09,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:09,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280805332] [2020-02-10 20:09:09,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:09,715 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:09:09,849 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:09,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:09:09,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280805332] [2020-02-10 20:09:09,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:09,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:09,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346536310] [2020-02-10 20:09:09,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:09,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:09,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:09,859 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:09:10,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:10,115 INFO L93 Difference]: Finished difference Result 6012 states and 26787 transitions. [2020-02-10 20:09:10,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:10,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:10,130 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:09:10,131 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:09:10,131 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:09:10,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 20:09:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:09:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:09:10,331 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:09:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:10,331 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:09:10,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:09:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:10,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:10,336 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:10,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:10,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1349199380, now seen corresponding path program 540 times [2020-02-10 20:09:10,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:10,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046530297] [2020-02-10 20:09:10,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:10,880 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:09:11,008 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:11,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046530297] [2020-02-10 20:09:11,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:11,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375608149] [2020-02-10 20:09:11,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:11,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:11,019 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:09:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:11,209 INFO L93 Difference]: Finished difference Result 6018 states and 26793 transitions. [2020-02-10 20:09:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:11,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:11,224 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:09:11,225 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:09:11,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:09:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 20:09:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:09:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 20:09:11,431 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 20:09:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:11,431 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 20:09:11,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 20:09:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:11,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:11,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:11,436 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:11,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1376926228, now seen corresponding path program 541 times [2020-02-10 20:09:11,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:11,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856062875] [2020-02-10 20:09:11,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:11,975 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:12,108 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:12,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:09:12,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856062875] [2020-02-10 20:09:12,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:12,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:12,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134750235] [2020-02-10 20:09:12,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:12,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:12,119 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 20:09:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:12,358 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 20:09:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:12,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:12,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:12,371 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:09:12,372 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 20:09:12,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:12,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 20:09:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3131. [2020-02-10 20:09:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:09:12,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15588 transitions. [2020-02-10 20:09:12,576 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15588 transitions. Word has length 31 [2020-02-10 20:09:12,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:12,576 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15588 transitions. [2020-02-10 20:09:12,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15588 transitions. [2020-02-10 20:09:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:12,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:12,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:12,582 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash -39359014, now seen corresponding path program 542 times [2020-02-10 20:09:12,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:12,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334215532] [2020-02-10 20:09:12,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:13,118 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:13,248 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:13,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334215532] [2020-02-10 20:09:13,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:13,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:13,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298019715] [2020-02-10 20:09:13,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:13,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:13,258 INFO L87 Difference]: Start difference. First operand 3131 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:09:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:13,513 INFO L93 Difference]: Finished difference Result 6022 states and 26816 transitions. [2020-02-10 20:09:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:13,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:13,527 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:09:13,528 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:09:13,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:09:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 20:09:13,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15568 transitions. [2020-02-10 20:09:13,735 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15568 transitions. Word has length 31 [2020-02-10 20:09:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:13,735 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15568 transitions. [2020-02-10 20:09:13,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15568 transitions. [2020-02-10 20:09:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:13,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:13,740 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393082, now seen corresponding path program 543 times [2020-02-10 20:09:13,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:13,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55955798] [2020-02-10 20:09:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:14,211 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:09:14,339 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:14,473 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:14,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:09:14,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55955798] [2020-02-10 20:09:14,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:14,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:14,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191997407] [2020-02-10 20:09:14,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:14,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:14,482 INFO L87 Difference]: Start difference. First operand 3124 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:09:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:14,707 INFO L93 Difference]: Finished difference Result 6029 states and 26830 transitions. [2020-02-10 20:09:14,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:14,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:14,722 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:09:14,722 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:09:14,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:14,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:09:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3133. [2020-02-10 20:09:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:09:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 20:09:14,927 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 20:09:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:14,927 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 20:09:14,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 20:09:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:14,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:14,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:14,932 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1943283046, now seen corresponding path program 544 times [2020-02-10 20:09:14,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:14,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270706026] [2020-02-10 20:09:14,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:15,474 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:09:15,600 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:15,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270706026] [2020-02-10 20:09:15,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:15,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:15,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248114263] [2020-02-10 20:09:15,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:15,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:15,610 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:09:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:15,912 INFO L93 Difference]: Finished difference Result 6032 states and 26827 transitions. [2020-02-10 20:09:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:15,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:15,927 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:09:15,927 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:09:15,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:09:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:09:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15560 transitions. [2020-02-10 20:09:16,129 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15560 transitions. Word has length 31 [2020-02-10 20:09:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:16,129 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15560 transitions. [2020-02-10 20:09:16,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15560 transitions. [2020-02-10 20:09:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:16,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:16,134 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:16,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:16,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2134052102, now seen corresponding path program 545 times [2020-02-10 20:09:16,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:16,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91305479] [2020-02-10 20:09:16,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:16,663 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:16,793 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:16,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91305479] [2020-02-10 20:09:16,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:16,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:16,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098932677] [2020-02-10 20:09:16,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:16,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:16,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:16,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:16,803 INFO L87 Difference]: Start difference. First operand 3124 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:09:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:17,045 INFO L93 Difference]: Finished difference Result 6026 states and 26815 transitions. [2020-02-10 20:09:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:17,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:17,060 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:09:17,060 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:09:17,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:17,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:09:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3132. [2020-02-10 20:09:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:09:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15575 transitions. [2020-02-10 20:09:17,258 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15575 transitions. Word has length 31 [2020-02-10 20:09:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:17,259 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15575 transitions. [2020-02-10 20:09:17,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15575 transitions. [2020-02-10 20:09:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:17,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:17,264 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 866594924, now seen corresponding path program 546 times [2020-02-10 20:09:17,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:17,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734066283] [2020-02-10 20:09:17,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:17,807 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:17,940 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:17,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734066283] [2020-02-10 20:09:17,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:17,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:17,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214712131] [2020-02-10 20:09:17,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:17,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:17,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:17,950 INFO L87 Difference]: Start difference. First operand 3132 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:09:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:18,156 INFO L93 Difference]: Finished difference Result 6030 states and 26815 transitions. [2020-02-10 20:09:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:18,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:18,171 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:09:18,171 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:09:18,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:09:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3116. [2020-02-10 20:09:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:09:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 20:09:18,374 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 20:09:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:18,374 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 20:09:18,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:18,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 20:09:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:18,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:18,380 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:18,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1542862, now seen corresponding path program 547 times [2020-02-10 20:09:18,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:18,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872580792] [2020-02-10 20:09:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:18,909 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:19,037 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:19,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:09:19,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872580792] [2020-02-10 20:09:19,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:19,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:19,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986705545] [2020-02-10 20:09:19,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:19,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:19,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:19,048 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 20:09:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:19,285 INFO L93 Difference]: Finished difference Result 6005 states and 26772 transitions. [2020-02-10 20:09:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:19,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:19,300 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:09:19,301 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:09:19,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:19,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:09:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 20:09:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:09:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 20:09:19,503 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 20:09:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:19,503 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 20:09:19,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 20:09:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:19,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:19,509 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:19,509 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1761595802, now seen corresponding path program 548 times [2020-02-10 20:09:19,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:19,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463732196] [2020-02-10 20:09:19,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:20,037 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:20,168 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:20,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463732196] [2020-02-10 20:09:20,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:20,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:20,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844443775] [2020-02-10 20:09:20,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:20,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:20,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:20,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:20,179 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:09:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:20,409 INFO L93 Difference]: Finished difference Result 6007 states and 26771 transitions. [2020-02-10 20:09:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:20,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:20,424 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:09:20,424 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:09:20,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:09:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 20:09:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:09:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:09:20,630 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:09:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:20,630 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:09:20,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:09:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:20,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:20,635 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:20,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:20,635 INFO L82 PathProgramCache]: Analyzing trace with hash -634923992, now seen corresponding path program 549 times [2020-02-10 20:09:20,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:20,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768005137] [2020-02-10 20:09:20,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:21,161 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:21,292 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:21,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:09:21,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768005137] [2020-02-10 20:09:21,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:21,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:21,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525549626] [2020-02-10 20:09:21,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:21,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:21,303 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:09:21,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:21,544 INFO L93 Difference]: Finished difference Result 6010 states and 26776 transitions. [2020-02-10 20:09:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:21,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:21,559 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:09:21,559 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:09:21,559 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:09:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 20:09:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:09:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 20:09:21,758 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 20:09:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:21,758 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 20:09:21,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 20:09:21,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:21,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:21,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:21,764 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:21,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:21,764 INFO L82 PathProgramCache]: Analyzing trace with hash -142328230, now seen corresponding path program 550 times [2020-02-10 20:09:21,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:21,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906614318] [2020-02-10 20:09:21,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:22,292 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:22,421 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:22,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:09:22,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906614318] [2020-02-10 20:09:22,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:22,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:22,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900067527] [2020-02-10 20:09:22,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:22,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:22,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:22,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:22,431 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:09:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:22,623 INFO L93 Difference]: Finished difference Result 6016 states and 26782 transitions. [2020-02-10 20:09:22,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:22,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:22,637 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:09:22,637 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:09:22,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:09:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3122. [2020-02-10 20:09:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:09:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:09:22,844 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:09:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:22,844 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:09:22,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:09:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:22,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:22,850 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash -147804760, now seen corresponding path program 551 times [2020-02-10 20:09:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:22,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002283609] [2020-02-10 20:09:22,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:23,426 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:23,554 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:23,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:09:23,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002283609] [2020-02-10 20:09:23,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:23,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:23,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561815937] [2020-02-10 20:09:23,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:23,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:23,564 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:09:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:23,832 INFO L93 Difference]: Finished difference Result 6016 states and 26784 transitions. [2020-02-10 20:09:23,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:23,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:23,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:23,847 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:09:23,847 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:09:23,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:09:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 20:09:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:09:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15565 transitions. [2020-02-10 20:09:24,052 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15565 transitions. Word has length 31 [2020-02-10 20:09:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:24,052 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15565 transitions. [2020-02-10 20:09:24,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15565 transitions. [2020-02-10 20:09:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:24,057 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:24,058 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1415261938, now seen corresponding path program 552 times [2020-02-10 20:09:24,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:24,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71147059] [2020-02-10 20:09:24,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:24,596 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:09:24,728 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:24,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:09:24,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71147059] [2020-02-10 20:09:24,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:24,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:24,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485651201] [2020-02-10 20:09:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:24,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:24,738 INFO L87 Difference]: Start difference. First operand 3130 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:09:24,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:24,947 INFO L93 Difference]: Finished difference Result 6020 states and 26784 transitions. [2020-02-10 20:09:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:24,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:24,963 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:09:24,963 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:09:24,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:09:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3110. [2020-02-10 20:09:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:09:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15522 transitions. [2020-02-10 20:09:25,170 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15522 transitions. Word has length 31 [2020-02-10 20:09:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:25,170 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15522 transitions. [2020-02-10 20:09:25,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15522 transitions. [2020-02-10 20:09:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:25,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:25,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:25,175 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1910641922, now seen corresponding path program 553 times [2020-02-10 20:09:25,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:25,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631057223] [2020-02-10 20:09:25,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:25,714 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:25,844 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:25,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631057223] [2020-02-10 20:09:25,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:25,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:25,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100658690] [2020-02-10 20:09:25,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:25,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:25,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:25,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:25,854 INFO L87 Difference]: Start difference. First operand 3110 states and 15522 transitions. Second operand 12 states. [2020-02-10 20:09:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:26,127 INFO L93 Difference]: Finished difference Result 6017 states and 26824 transitions. [2020-02-10 20:09:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:26,127 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:26,142 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:09:26,142 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:09:26,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:26,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:09:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:09:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:09:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15589 transitions. [2020-02-10 20:09:26,341 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15589 transitions. Word has length 31 [2020-02-10 20:09:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:26,341 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15589 transitions. [2020-02-10 20:09:26,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15589 transitions. [2020-02-10 20:09:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:26,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:26,346 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:26,346 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:26,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:26,346 INFO L82 PathProgramCache]: Analyzing trace with hash 271896744, now seen corresponding path program 554 times [2020-02-10 20:09:26,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:26,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329486548] [2020-02-10 20:09:26,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:26,882 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:27,010 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:27,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329486548] [2020-02-10 20:09:27,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:27,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:27,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436262891] [2020-02-10 20:09:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:27,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:27,021 INFO L87 Difference]: Start difference. First operand 3129 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:09:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:27,280 INFO L93 Difference]: Finished difference Result 6015 states and 26814 transitions. [2020-02-10 20:09:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:27,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:27,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:27,294 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:09:27,294 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:09:27,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:09:27,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:09:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:09:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15572 transitions. [2020-02-10 20:09:27,495 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15572 transitions. Word has length 31 [2020-02-10 20:09:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:27,495 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15572 transitions. [2020-02-10 20:09:27,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15572 transitions. [2020-02-10 20:09:27,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:27,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:27,500 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1960014138, now seen corresponding path program 555 times [2020-02-10 20:09:27,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:27,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30151181] [2020-02-10 20:09:27,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:28,037 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:28,169 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:09:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:28,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30151181] [2020-02-10 20:09:28,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:28,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:28,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159578388] [2020-02-10 20:09:28,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:28,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:28,179 INFO L87 Difference]: Start difference. First operand 3123 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:09:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:28,468 INFO L93 Difference]: Finished difference Result 6019 states and 26823 transitions. [2020-02-10 20:09:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:28,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:28,483 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:09:28,483 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:09:28,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:28,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:09:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3130. [2020-02-10 20:09:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:09:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15585 transitions. [2020-02-10 20:09:28,688 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15585 transitions. Word has length 31 [2020-02-10 20:09:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:28,688 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15585 transitions. [2020-02-10 20:09:28,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15585 transitions. [2020-02-10 20:09:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:28,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:28,693 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:28,693 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:28,693 INFO L82 PathProgramCache]: Analyzing trace with hash -997385944, now seen corresponding path program 556 times [2020-02-10 20:09:28,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:28,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572026770] [2020-02-10 20:09:28,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:29,243 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:29,372 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:29,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572026770] [2020-02-10 20:09:29,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:29,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:29,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463675346] [2020-02-10 20:09:29,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:29,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:29,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:29,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:29,381 INFO L87 Difference]: Start difference. First operand 3130 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:09:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:29,619 INFO L93 Difference]: Finished difference Result 6018 states and 26814 transitions. [2020-02-10 20:09:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:29,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:29,634 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:09:29,634 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:09:29,634 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:09:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 20:09:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:09:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15566 transitions. [2020-02-10 20:09:29,840 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15566 transitions. Word has length 31 [2020-02-10 20:09:29,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:29,841 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15566 transitions. [2020-02-10 20:09:29,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15566 transitions. [2020-02-10 20:09:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:29,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:29,846 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1213192582, now seen corresponding path program 557 times [2020-02-10 20:09:29,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:29,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499656179] [2020-02-10 20:09:29,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:30,407 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:30,536 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499656179] [2020-02-10 20:09:30,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:30,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:30,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132164695] [2020-02-10 20:09:30,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:30,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:30,547 INFO L87 Difference]: Start difference. First operand 3123 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:09:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:30,797 INFO L93 Difference]: Finished difference Result 6014 states and 26806 transitions. [2020-02-10 20:09:30,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:30,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:30,812 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:09:30,812 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:09:30,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:09:31,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3129. [2020-02-10 20:09:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:09:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15577 transitions. [2020-02-10 20:09:31,011 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15577 transitions. Word has length 31 [2020-02-10 20:09:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:31,011 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15577 transitions. [2020-02-10 20:09:31,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15577 transitions. [2020-02-10 20:09:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:31,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:31,016 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:31,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2058164034, now seen corresponding path program 558 times [2020-02-10 20:09:31,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:31,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469689420] [2020-02-10 20:09:31,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:31,573 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:31,708 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:31,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469689420] [2020-02-10 20:09:31,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:31,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:31,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492715986] [2020-02-10 20:09:31,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:31,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:31,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:31,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:31,717 INFO L87 Difference]: Start difference. First operand 3129 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:09:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:31,972 INFO L93 Difference]: Finished difference Result 6015 states and 26802 transitions. [2020-02-10 20:09:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:31,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:31,987 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:09:31,987 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 20:09:31,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 20:09:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3117. [2020-02-10 20:09:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:09:32,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15549 transitions. [2020-02-10 20:09:32,231 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15549 transitions. Word has length 31 [2020-02-10 20:09:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:32,231 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15549 transitions. [2020-02-10 20:09:32,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:32,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15549 transitions. [2020-02-10 20:09:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:32,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:32,236 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:32,236 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -166277916, now seen corresponding path program 559 times [2020-02-10 20:09:32,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:32,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196269810] [2020-02-10 20:09:32,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:32,775 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:32,905 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:32,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:09:32,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196269810] [2020-02-10 20:09:32,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:32,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:32,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388015843] [2020-02-10 20:09:32,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:32,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:32,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:32,915 INFO L87 Difference]: Start difference. First operand 3117 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:09:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:33,206 INFO L93 Difference]: Finished difference Result 6025 states and 26835 transitions. [2020-02-10 20:09:33,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:33,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:33,221 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:09:33,221 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:09:33,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:09:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:09:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:09:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 20:09:33,421 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 20:09:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:33,422 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 20:09:33,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 20:09:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:33,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:33,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:33,427 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2016260750, now seen corresponding path program 560 times [2020-02-10 20:09:33,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:33,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488178533] [2020-02-10 20:09:33,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:33,964 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:34,097 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:34,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:09:34,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488178533] [2020-02-10 20:09:34,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:34,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:34,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214603643] [2020-02-10 20:09:34,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:34,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:34,108 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:09:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:34,370 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 20:09:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:34,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:34,384 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:09:34,384 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:09:34,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:09:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 20:09:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:09:34,591 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:09:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:34,592 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:09:34,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:09:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:34,597 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:34,597 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1227056006, now seen corresponding path program 561 times [2020-02-10 20:09:34,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:34,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941297034] [2020-02-10 20:09:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:35,148 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:35,274 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:35,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:35,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941297034] [2020-02-10 20:09:35,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:35,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:35,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094814980] [2020-02-10 20:09:35,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:35,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:35,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:35,284 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:09:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:35,527 INFO L93 Difference]: Finished difference Result 6033 states and 26846 transitions. [2020-02-10 20:09:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:35,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:35,543 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:09:35,543 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:09:35,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:09:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3133. [2020-02-10 20:09:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:09:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15586 transitions. [2020-02-10 20:09:35,742 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15586 transitions. Word has length 31 [2020-02-10 20:09:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:35,742 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15586 transitions. [2020-02-10 20:09:35,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15586 transitions. [2020-02-10 20:09:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:35,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:35,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:35,748 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:35,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:35,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1156945970, now seen corresponding path program 562 times [2020-02-10 20:09:35,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:35,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892914044] [2020-02-10 20:09:35,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:36,298 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:09:36,432 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:36,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:09:36,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892914044] [2020-02-10 20:09:36,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:36,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:36,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426145381] [2020-02-10 20:09:36,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:36,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:36,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:36,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:36,443 INFO L87 Difference]: Start difference. First operand 3133 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:09:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:36,689 INFO L93 Difference]: Finished difference Result 6036 states and 26843 transitions. [2020-02-10 20:09:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:36,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:36,704 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:09:36,704 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:09:36,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:09:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3124. [2020-02-10 20:09:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15562 transitions. [2020-02-10 20:09:36,910 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15562 transitions. Word has length 31 [2020-02-10 20:09:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:36,910 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15562 transitions. [2020-02-10 20:09:36,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15562 transitions. [2020-02-10 20:09:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:36,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:36,915 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:36,916 INFO L82 PathProgramCache]: Analyzing trace with hash -105295430, now seen corresponding path program 563 times [2020-02-10 20:09:36,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:36,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579367737] [2020-02-10 20:09:36,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:37,575 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:37,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:09:37,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579367737] [2020-02-10 20:09:37,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:37,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:37,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849573763] [2020-02-10 20:09:37,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:37,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:37,585 INFO L87 Difference]: Start difference. First operand 3124 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:09:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:37,842 INFO L93 Difference]: Finished difference Result 6027 states and 26825 transitions. [2020-02-10 20:09:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:37,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:37,857 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:09:37,858 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:09:37,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:09:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3131. [2020-02-10 20:09:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:09:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15575 transitions. [2020-02-10 20:09:38,061 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15575 transitions. Word has length 31 [2020-02-10 20:09:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:38,061 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15575 transitions. [2020-02-10 20:09:38,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15575 transitions. [2020-02-10 20:09:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:38,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:38,067 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:38,067 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2077243236, now seen corresponding path program 564 times [2020-02-10 20:09:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:38,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356653891] [2020-02-10 20:09:38,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:38,608 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:09:38,739 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:09:38,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:09:38,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356653891] [2020-02-10 20:09:38,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:38,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:38,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752410415] [2020-02-10 20:09:38,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:38,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:38,750 INFO L87 Difference]: Start difference. First operand 3131 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:09:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:38,977 INFO L93 Difference]: Finished difference Result 6032 states and 26828 transitions. [2020-02-10 20:09:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:38,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:38,993 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:09:38,993 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:09:38,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:09:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3117. [2020-02-10 20:09:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:09:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15542 transitions. [2020-02-10 20:09:39,199 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15542 transitions. Word has length 31 [2020-02-10 20:09:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:39,199 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15542 transitions. [2020-02-10 20:09:39,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15542 transitions. [2020-02-10 20:09:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:39,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:39,204 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash -859335580, now seen corresponding path program 565 times [2020-02-10 20:09:39,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:39,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158005277] [2020-02-10 20:09:39,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:39,757 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:39,890 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:09:39,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:09:39,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158005277] [2020-02-10 20:09:39,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:39,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:39,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204206825] [2020-02-10 20:09:39,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:39,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:39,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:39,901 INFO L87 Difference]: Start difference. First operand 3117 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:09:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:40,252 INFO L93 Difference]: Finished difference Result 6031 states and 26845 transitions. [2020-02-10 20:09:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:40,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:40,267 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:09:40,267 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:09:40,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:09:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3132. [2020-02-10 20:09:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:09:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15585 transitions. [2020-02-10 20:09:40,471 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15585 transitions. Word has length 31 [2020-02-10 20:09:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:40,471 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15585 transitions. [2020-02-10 20:09:40,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15585 transitions. [2020-02-10 20:09:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:40,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:40,476 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:40,477 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:40,477 INFO L82 PathProgramCache]: Analyzing trace with hash 478231634, now seen corresponding path program 566 times [2020-02-10 20:09:40,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:40,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050754053] [2020-02-10 20:09:40,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:41,025 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:41,198 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:41,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050754053] [2020-02-10 20:09:41,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:41,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:41,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945155283] [2020-02-10 20:09:41,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:41,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:41,208 INFO L87 Difference]: Start difference. First operand 3132 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:09:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:41,458 INFO L93 Difference]: Finished difference Result 6030 states and 26836 transitions. [2020-02-10 20:09:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:41,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:41,474 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:09:41,474 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:09:41,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:09:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3125. [2020-02-10 20:09:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:09:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15565 transitions. [2020-02-10 20:09:41,676 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15565 transitions. Word has length 31 [2020-02-10 20:09:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:41,676 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15565 transitions. [2020-02-10 20:09:41,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:41,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15565 transitions. [2020-02-10 20:09:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:41,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:41,682 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1495802434, now seen corresponding path program 567 times [2020-02-10 20:09:41,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:41,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217169621] [2020-02-10 20:09:41,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:42,230 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:09:42,358 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:09:42,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:09:42,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217169621] [2020-02-10 20:09:42,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:42,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:42,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16894137] [2020-02-10 20:09:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:42,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:42,368 INFO L87 Difference]: Start difference. First operand 3125 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:09:42,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:42,718 INFO L93 Difference]: Finished difference Result 6037 states and 26850 transitions. [2020-02-10 20:09:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:42,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:42,733 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:09:42,734 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:09:42,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:42,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:09:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3134. [2020-02-10 20:09:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:09:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15582 transitions. [2020-02-10 20:09:42,934 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15582 transitions. Word has length 31 [2020-02-10 20:09:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:42,934 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15582 transitions. [2020-02-10 20:09:42,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15582 transitions. [2020-02-10 20:09:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:42,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:42,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:42,939 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:42,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1425692398, now seen corresponding path program 568 times [2020-02-10 20:09:42,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:42,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841425589] [2020-02-10 20:09:42,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:43,497 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 20:09:43,630 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:09:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:43,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841425589] [2020-02-10 20:09:43,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:43,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:43,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655797225] [2020-02-10 20:09:43,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:43,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:43,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:43,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:43,641 INFO L87 Difference]: Start difference. First operand 3134 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:09:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:43,966 INFO L93 Difference]: Finished difference Result 6040 states and 26847 transitions. [2020-02-10 20:09:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:43,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:43,981 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:09:43,981 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:09:43,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:09:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3125. [2020-02-10 20:09:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:09:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 20:09:44,190 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 20:09:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:44,190 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 20:09:44,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 20:09:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:44,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:44,195 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1643324546, now seen corresponding path program 569 times [2020-02-10 20:09:44,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:44,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695986651] [2020-02-10 20:09:44,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:44,742 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:44,869 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:44,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:44,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695986651] [2020-02-10 20:09:44,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:44,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:44,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458499351] [2020-02-10 20:09:44,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:44,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:44,878 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:09:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:45,236 INFO L93 Difference]: Finished difference Result 6034 states and 26835 transitions. [2020-02-10 20:09:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:45,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:45,251 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:09:45,252 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:09:45,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:09:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 20:09:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:09:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15572 transitions. [2020-02-10 20:09:45,451 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15572 transitions. Word has length 31 [2020-02-10 20:09:45,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:45,451 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15572 transitions. [2020-02-10 20:09:45,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:45,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15572 transitions. [2020-02-10 20:09:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:45,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:45,456 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:45,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:45,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1384185572, now seen corresponding path program 570 times [2020-02-10 20:09:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113817441] [2020-02-10 20:09:45,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:46,006 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:09:46,139 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:46,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:09:46,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113817441] [2020-02-10 20:09:46,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:46,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:46,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923569605] [2020-02-10 20:09:46,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:46,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:46,149 INFO L87 Difference]: Start difference. First operand 3133 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:09:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:46,380 INFO L93 Difference]: Finished difference Result 6038 states and 26835 transitions. [2020-02-10 20:09:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:46,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:46,395 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:09:46,395 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:09:46,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:09:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3117. [2020-02-10 20:09:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:09:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15535 transitions. [2020-02-10 20:09:46,600 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15535 transitions. Word has length 31 [2020-02-10 20:09:46,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:46,600 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15535 transitions. [2020-02-10 20:09:46,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15535 transitions. [2020-02-10 20:09:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:46,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:46,605 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1738042574, now seen corresponding path program 571 times [2020-02-10 20:09:46,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:46,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556868529] [2020-02-10 20:09:46,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:47,153 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:47,283 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:47,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556868529] [2020-02-10 20:09:47,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:47,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:47,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885863946] [2020-02-10 20:09:47,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:47,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:47,292 INFO L87 Difference]: Start difference. First operand 3117 states and 15535 transitions. Second operand 12 states. [2020-02-10 20:09:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:47,551 INFO L93 Difference]: Finished difference Result 6020 states and 26810 transitions. [2020-02-10 20:09:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:47,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:47,566 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:09:47,567 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:09:47,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:47,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:09:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3130. [2020-02-10 20:09:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:09:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15572 transitions. [2020-02-10 20:09:47,766 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15572 transitions. Word has length 31 [2020-02-10 20:09:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:47,766 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15572 transitions. [2020-02-10 20:09:47,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15572 transitions. [2020-02-10 20:09:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:47,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:47,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:47,771 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:47,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 893071122, now seen corresponding path program 572 times [2020-02-10 20:09:47,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:47,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053651827] [2020-02-10 20:09:47,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:48,334 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:48,466 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:48,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:09:48,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053651827] [2020-02-10 20:09:48,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:48,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:48,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736859200] [2020-02-10 20:09:48,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:48,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:48,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:48,476 INFO L87 Difference]: Start difference. First operand 3130 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:09:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:48,698 INFO L93 Difference]: Finished difference Result 6021 states and 26806 transitions. [2020-02-10 20:09:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:48,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:48,713 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:09:48,714 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:09:48,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:09:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 20:09:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15555 transitions. [2020-02-10 20:09:48,914 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15555 transitions. Word has length 31 [2020-02-10 20:09:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:48,914 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15555 transitions. [2020-02-10 20:09:48,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15555 transitions. [2020-02-10 20:09:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:48,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:48,920 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:48,920 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:48,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:48,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1101575720, now seen corresponding path program 573 times [2020-02-10 20:09:48,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:48,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027671455] [2020-02-10 20:09:48,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:49,450 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:49,582 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:49,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:09:49,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027671455] [2020-02-10 20:09:49,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:49,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:49,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539985365] [2020-02-10 20:09:49,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:49,592 INFO L87 Difference]: Start difference. First operand 3124 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:09:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:49,844 INFO L93 Difference]: Finished difference Result 6025 states and 26813 transitions. [2020-02-10 20:09:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:49,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:49,859 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:09:49,859 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:09:49,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:09:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 20:09:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:09:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15568 transitions. [2020-02-10 20:09:50,125 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15568 transitions. Word has length 31 [2020-02-10 20:09:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:50,125 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15568 transitions. [2020-02-10 20:09:50,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15568 transitions. [2020-02-10 20:09:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:50,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:50,131 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:50,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852910, now seen corresponding path program 574 times [2020-02-10 20:09:50,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:50,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689611411] [2020-02-10 20:09:50,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:50,666 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:09:50,799 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:50,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:09:50,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689611411] [2020-02-10 20:09:50,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:50,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:50,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61402166] [2020-02-10 20:09:50,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:50,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:50,809 INFO L87 Difference]: Start difference. First operand 3131 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:09:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:50,988 INFO L93 Difference]: Finished difference Result 6030 states and 26816 transitions. [2020-02-10 20:09:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:50,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:51,003 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:09:51,003 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:09:51,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:09:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:09:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:09:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15548 transitions. [2020-02-10 20:09:51,202 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15548 transitions. Word has length 31 [2020-02-10 20:09:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:51,202 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15548 transitions. [2020-02-10 20:09:51,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15548 transitions. [2020-02-10 20:09:51,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:51,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:51,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:51,208 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:51,208 INFO L82 PathProgramCache]: Analyzing trace with hash -167706968, now seen corresponding path program 575 times [2020-02-10 20:09:51,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:51,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20877976] [2020-02-10 20:09:51,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:51,752 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:51,897 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:51,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:09:51,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20877976] [2020-02-10 20:09:51,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:51,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:51,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210062891] [2020-02-10 20:09:51,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:51,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:51,907 INFO L87 Difference]: Start difference. First operand 3124 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:09:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:52,145 INFO L93 Difference]: Finished difference Result 6028 states and 26813 transitions. [2020-02-10 20:09:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:52,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:52,160 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:09:52,160 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:09:52,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:09:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3132. [2020-02-10 20:09:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:09:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15563 transitions. [2020-02-10 20:09:52,360 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15563 transitions. Word has length 31 [2020-02-10 20:09:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:52,360 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15563 transitions. [2020-02-10 20:09:52,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15563 transitions. [2020-02-10 20:09:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:52,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:52,365 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:52,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:52,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1435164146, now seen corresponding path program 576 times [2020-02-10 20:09:52,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:52,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743872792] [2020-02-10 20:09:52,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:52,912 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:09:53,045 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:53,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743872792] [2020-02-10 20:09:53,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:53,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:53,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475212249] [2020-02-10 20:09:53,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:53,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:53,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:53,055 INFO L87 Difference]: Start difference. First operand 3132 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:09:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:53,272 INFO L93 Difference]: Finished difference Result 6032 states and 26813 transitions. [2020-02-10 20:09:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:53,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:53,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:53,287 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:09:53,287 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:09:53,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:09:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3110. [2020-02-10 20:09:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:09:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15516 transitions. [2020-02-10 20:09:53,493 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15516 transitions. Word has length 31 [2020-02-10 20:09:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:53,493 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15516 transitions. [2020-02-10 20:09:53,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:53,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15516 transitions. [2020-02-10 20:09:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:53,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:53,499 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:53,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:53,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1744708478, now seen corresponding path program 577 times [2020-02-10 20:09:53,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:53,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186589526] [2020-02-10 20:09:53,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:54,043 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:54,171 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:09:54,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:09:54,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186589526] [2020-02-10 20:09:54,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:54,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:54,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51917672] [2020-02-10 20:09:54,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:54,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:54,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:54,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:54,181 INFO L87 Difference]: Start difference. First operand 3110 states and 15516 transitions. Second operand 12 states. [2020-02-10 20:09:54,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:54,399 INFO L93 Difference]: Finished difference Result 5989 states and 26739 transitions. [2020-02-10 20:09:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:54,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:54,414 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:09:54,414 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:09:54,415 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:09:54,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3126. [2020-02-10 20:09:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:09:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:09:54,618 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:09:54,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:54,618 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:09:54,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:09:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:54,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:54,623 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:54,623 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:54,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash 54765574, now seen corresponding path program 578 times [2020-02-10 20:09:54,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:54,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961190610] [2020-02-10 20:09:54,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:55,165 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:55,297 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:55,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:09:55,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961190610] [2020-02-10 20:09:55,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:55,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:55,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314785521] [2020-02-10 20:09:55,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:55,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:55,306 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:09:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:55,530 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 20:09:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:55,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:55,546 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:09:55,546 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:09:55,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:09:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:09:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:09:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 20:09:55,747 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 20:09:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:55,747 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 20:09:55,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 20:09:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:55,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:55,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:55,752 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:55,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:55,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1320397242, now seen corresponding path program 579 times [2020-02-10 20:09:55,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:55,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063413041] [2020-02-10 20:09:55,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:56,425 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:56,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:09:56,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063413041] [2020-02-10 20:09:56,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:56,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:56,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318643494] [2020-02-10 20:09:56,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:56,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:56,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:56,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:56,434 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:09:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:56,691 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 20:09:56,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:56,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:56,706 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:09:56,706 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:09:56,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:09:56,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3126. [2020-02-10 20:09:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:09:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15567 transitions. [2020-02-10 20:09:56,912 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15567 transitions. Word has length 31 [2020-02-10 20:09:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:56,912 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15567 transitions. [2020-02-10 20:09:56,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15567 transitions. [2020-02-10 20:09:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:56,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:56,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:56,918 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1214517114, now seen corresponding path program 580 times [2020-02-10 20:09:56,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:56,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479232365] [2020-02-10 20:09:56,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:57,466 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:09:57,602 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:09:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:09:57,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479232365] [2020-02-10 20:09:57,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:57,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:57,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88720665] [2020-02-10 20:09:57,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:57,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:57,612 INFO L87 Difference]: Start difference. First operand 3126 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:09:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:57,875 INFO L93 Difference]: Finished difference Result 5992 states and 26735 transitions. [2020-02-10 20:09:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:57,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:57,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:57,889 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:09:57,889 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:09:57,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:09:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:09:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:09:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15553 transitions. [2020-02-10 20:09:58,094 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15553 transitions. Word has length 31 [2020-02-10 20:09:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:58,094 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15553 transitions. [2020-02-10 20:09:58,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15553 transitions. [2020-02-10 20:09:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:58,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:58,099 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:58,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:58,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1218168134, now seen corresponding path program 581 times [2020-02-10 20:09:58,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:58,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043797718] [2020-02-10 20:09:58,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:58,776 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:58,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:09:58,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043797718] [2020-02-10 20:09:58,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:58,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:58,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79989261] [2020-02-10 20:09:58,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:58,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:58,787 INFO L87 Difference]: Start difference. First operand 3121 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:09:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:09:58,997 INFO L93 Difference]: Finished difference Result 5993 states and 26738 transitions. [2020-02-10 20:09:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:09:58,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:09:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:09:59,013 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:09:59,013 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:09:59,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:09:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:09:59,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 20:09:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:09:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 20:09:59,260 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 20:09:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:09:59,260 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 20:09:59,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:09:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 20:09:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:09:59,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:09:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:09:59,266 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:09:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:09:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2063139586, now seen corresponding path program 582 times [2020-02-10 20:09:59,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:09:59,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813961621] [2020-02-10 20:09:59,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:09:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:09:59,824 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:09:59,955 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:09:59,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:09:59,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813961621] [2020-02-10 20:09:59,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:09:59,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:09:59,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840661867] [2020-02-10 20:09:59,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:09:59,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:09:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:09:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:09:59,965 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:10:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:00,229 INFO L93 Difference]: Finished difference Result 5994 states and 26734 transitions. [2020-02-10 20:10:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:00,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:00,245 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:10:00,245 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 20:10:00,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 20:10:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3116. [2020-02-10 20:10:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:10:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 20:10:00,445 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 20:10:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:00,445 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 20:10:00,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 20:10:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:00,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:00,451 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -805894812, now seen corresponding path program 583 times [2020-02-10 20:10:00,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:00,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132300040] [2020-02-10 20:10:00,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:00,974 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:01,107 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:01,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132300040] [2020-02-10 20:10:01,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:01,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:01,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940093841] [2020-02-10 20:10:01,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:01,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:01,117 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 20:10:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:01,382 INFO L93 Difference]: Finished difference Result 5996 states and 26748 transitions. [2020-02-10 20:10:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:01,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:01,398 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:10:01,398 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:10:01,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:10:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 20:10:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:10:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 20:10:01,599 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 20:10:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:01,599 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 20:10:01,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 20:10:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:01,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:01,604 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1799129580, now seen corresponding path program 584 times [2020-02-10 20:10:01,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:01,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938726093] [2020-02-10 20:10:01,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:02,134 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:02,265 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:02,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938726093] [2020-02-10 20:10:02,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:02,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:02,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283870628] [2020-02-10 20:10:02,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:02,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:02,275 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:10:02,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:02,498 INFO L93 Difference]: Finished difference Result 5997 states and 26745 transitions. [2020-02-10 20:10:02,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:02,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:02,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:02,514 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:10:02,514 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:10:02,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:10:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3122. [2020-02-10 20:10:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:10:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:10:02,712 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:10:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:02,712 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:10:02,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:10:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:02,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:02,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:02,717 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1866672902, now seen corresponding path program 585 times [2020-02-10 20:10:02,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:02,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003561020] [2020-02-10 20:10:02,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:03,244 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:03,376 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:03,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:10:03,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003561020] [2020-02-10 20:10:03,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:03,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:03,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297534284] [2020-02-10 20:10:03,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:03,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:03,386 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:10:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:03,604 INFO L93 Difference]: Finished difference Result 6002 states and 26754 transitions. [2020-02-10 20:10:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:03,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:03,619 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:10:03,619 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 20:10:03,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 20:10:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3128. [2020-02-10 20:10:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:10:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 20:10:03,825 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 20:10:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:03,825 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 20:10:03,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 20:10:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:03,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:03,831 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1374077140, now seen corresponding path program 586 times [2020-02-10 20:10:03,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:03,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736090876] [2020-02-10 20:10:03,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:04,344 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2020-02-10 20:10:04,478 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:04,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736090876] [2020-02-10 20:10:04,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:04,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:04,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276493012] [2020-02-10 20:10:04,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:04,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:04,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:04,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:04,487 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:10:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:04,678 INFO L93 Difference]: Finished difference Result 6008 states and 26760 transitions. [2020-02-10 20:10:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:04,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:04,694 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:10:04,694 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:10:04,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:10:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3122. [2020-02-10 20:10:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:10:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:10:04,913 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:10:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:04,913 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:10:04,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:10:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:04,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:04,918 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:04,918 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -110270982, now seen corresponding path program 587 times [2020-02-10 20:10:04,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:04,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026435999] [2020-02-10 20:10:04,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:05,451 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:05,589 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:05,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026435999] [2020-02-10 20:10:05,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:05,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:05,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950929216] [2020-02-10 20:10:05,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:05,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:05,598 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:10:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:05,904 INFO L93 Difference]: Finished difference Result 6005 states and 26755 transitions. [2020-02-10 20:10:05,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:05,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:05,920 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:10:05,920 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:10:05,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:10:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3129. [2020-02-10 20:10:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:10:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15563 transitions. [2020-02-10 20:10:06,125 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15563 transitions. Word has length 31 [2020-02-10 20:10:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:06,126 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15563 transitions. [2020-02-10 20:10:06,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15563 transitions. [2020-02-10 20:10:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:06,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:06,131 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2072267684, now seen corresponding path program 588 times [2020-02-10 20:10:06,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:06,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689512821] [2020-02-10 20:10:06,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:06,683 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:10:06,813 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:06,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689512821] [2020-02-10 20:10:06,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:06,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:06,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091227114] [2020-02-10 20:10:06,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:06,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:06,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:06,823 INFO L87 Difference]: Start difference. First operand 3129 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:10:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:07,043 INFO L93 Difference]: Finished difference Result 6010 states and 26758 transitions. [2020-02-10 20:10:07,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:07,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:07,058 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:10:07,058 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:10:07,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:10:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3116. [2020-02-10 20:10:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:10:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15533 transitions. [2020-02-10 20:10:07,264 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15533 transitions. Word has length 31 [2020-02-10 20:10:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:07,265 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15533 transitions. [2020-02-10 20:10:07,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15533 transitions. [2020-02-10 20:10:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:07,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:07,270 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1498952476, now seen corresponding path program 589 times [2020-02-10 20:10:07,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:07,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142680454] [2020-02-10 20:10:07,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:07,801 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:07,933 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:07,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142680454] [2020-02-10 20:10:07,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:07,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:07,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941184919] [2020-02-10 20:10:07,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:07,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:07,942 INFO L87 Difference]: Start difference. First operand 3116 states and 15533 transitions. Second operand 12 states. [2020-02-10 20:10:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:08,196 INFO L93 Difference]: Finished difference Result 5999 states and 26749 transitions. [2020-02-10 20:10:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:08,197 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:08,212 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:10:08,212 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:10:08,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:10:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3127. [2020-02-10 20:10:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:10:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 20:10:08,465 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 20:10:08,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:08,465 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 20:10:08,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 20:10:08,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:08,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:08,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:08,471 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:08,471 INFO L82 PathProgramCache]: Analyzing trace with hash 261100464, now seen corresponding path program 590 times [2020-02-10 20:10:08,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:08,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624911895] [2020-02-10 20:10:08,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:08,995 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:09,125 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:09,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:10:09,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624911895] [2020-02-10 20:10:09,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:09,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:09,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992952718] [2020-02-10 20:10:09,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:09,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:09,135 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:10:09,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:09,447 INFO L93 Difference]: Finished difference Result 6001 states and 26748 transitions. [2020-02-10 20:10:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:09,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:09,463 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:10:09,463 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:10:09,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:09,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:10:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3122. [2020-02-10 20:10:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:10:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:10:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:10:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:09,673 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:10:09,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:10:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:09,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:09,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:09,678 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2135419330, now seen corresponding path program 591 times [2020-02-10 20:10:09,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:09,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826367578] [2020-02-10 20:10:09,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:10,203 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:10,332 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:10,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826367578] [2020-02-10 20:10:10,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:10,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:10,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293927415] [2020-02-10 20:10:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:10,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:10,342 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:10:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:10,645 INFO L93 Difference]: Finished difference Result 6004 states and 26753 transitions. [2020-02-10 20:10:10,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:10,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:10,661 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:10:10,661 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:10:10,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:10:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:10:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:10:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15561 transitions. [2020-02-10 20:10:10,860 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15561 transitions. Word has length 31 [2020-02-10 20:10:10,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:10,860 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15561 transitions. [2020-02-10 20:10:10,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15561 transitions. [2020-02-10 20:10:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:10,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:10,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:10,865 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:10,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:10,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1642823568, now seen corresponding path program 592 times [2020-02-10 20:10:10,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:10,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335520057] [2020-02-10 20:10:10,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:11,400 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:10:11,529 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:11,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335520057] [2020-02-10 20:10:11,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:11,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927851211] [2020-02-10 20:10:11,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:11,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:11,539 INFO L87 Difference]: Start difference. First operand 3128 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:10:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:11,740 INFO L93 Difference]: Finished difference Result 6010 states and 26759 transitions. [2020-02-10 20:10:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:11,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:11,754 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:10:11,754 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:10:11,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:10:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:10:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:10:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15544 transitions. [2020-02-10 20:10:11,958 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15544 transitions. Word has length 31 [2020-02-10 20:10:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:11,958 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15544 transitions. [2020-02-10 20:10:11,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15544 transitions. [2020-02-10 20:10:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:11,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:11,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:11,964 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1648300098, now seen corresponding path program 593 times [2020-02-10 20:10:11,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:11,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433885488] [2020-02-10 20:10:11,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:12,505 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:12,634 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:12,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:10:12,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433885488] [2020-02-10 20:10:12,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:12,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:12,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872976783] [2020-02-10 20:10:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:12,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:12,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:12,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:12,644 INFO L87 Difference]: Start difference. First operand 3122 states and 15544 transitions. Second operand 12 states. [2020-02-10 20:10:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:12,888 INFO L93 Difference]: Finished difference Result 6010 states and 26761 transitions. [2020-02-10 20:10:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:12,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:12,903 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:10:12,903 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:10:12,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:10:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3130. [2020-02-10 20:10:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:10:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15559 transitions. [2020-02-10 20:10:13,107 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15559 transitions. Word has length 31 [2020-02-10 20:10:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:13,107 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15559 transitions. [2020-02-10 20:10:13,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15559 transitions. [2020-02-10 20:10:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:13,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:13,112 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1379210020, now seen corresponding path program 594 times [2020-02-10 20:10:13,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:13,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133038285] [2020-02-10 20:10:13,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:13,656 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:10:13,791 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:13,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:10:13,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133038285] [2020-02-10 20:10:13,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:13,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:13,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499443084] [2020-02-10 20:10:13,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:13,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:13,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:13,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:13,801 INFO L87 Difference]: Start difference. First operand 3130 states and 15559 transitions. Second operand 12 states. [2020-02-10 20:10:13,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:13,993 INFO L93 Difference]: Finished difference Result 6014 states and 26761 transitions. [2020-02-10 20:10:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:13,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:13,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:14,007 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:10:14,007 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:10:14,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:10:14,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3116. [2020-02-10 20:10:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:10:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15527 transitions. [2020-02-10 20:10:14,213 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15527 transitions. Word has length 31 [2020-02-10 20:10:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:14,214 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15527 transitions. [2020-02-10 20:10:14,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15527 transitions. [2020-02-10 20:10:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:14,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:14,219 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:14,219 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash -280043412, now seen corresponding path program 595 times [2020-02-10 20:10:14,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:14,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382478080] [2020-02-10 20:10:14,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:14,758 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:14,889 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10: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:10:14,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382478080] [2020-02-10 20:10:14,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:14,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:14,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481730723] [2020-02-10 20:10:14,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:14,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:14,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:14,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:14,899 INFO L87 Difference]: Start difference. First operand 3116 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:10:15,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:15,144 INFO L93 Difference]: Finished difference Result 6006 states and 26762 transitions. [2020-02-10 20:10:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:15,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:15,159 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:10:15,159 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:10:15,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:10:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3129. [2020-02-10 20:10:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:10:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15564 transitions. [2020-02-10 20:10:15,365 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15564 transitions. Word has length 31 [2020-02-10 20:10:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:15,365 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15564 transitions. [2020-02-10 20:10:15,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15564 transitions. [2020-02-10 20:10:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:15,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:15,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:15,371 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:15,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1125014864, now seen corresponding path program 596 times [2020-02-10 20:10:15,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:15,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666585456] [2020-02-10 20:10:15,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:15,921 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:16,050 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:16,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666585456] [2020-02-10 20:10:16,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:16,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:16,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927540035] [2020-02-10 20:10:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:16,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:16,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:16,060 INFO L87 Difference]: Start difference. First operand 3129 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:10:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:16,296 INFO L93 Difference]: Finished difference Result 6007 states and 26758 transitions. [2020-02-10 20:10:16,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:16,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:16,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:16,310 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:10:16,311 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:10:16,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:10:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3123. [2020-02-10 20:10:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:10:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15547 transitions. [2020-02-10 20:10:16,510 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15547 transitions. Word has length 31 [2020-02-10 20:10:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:16,511 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15547 transitions. [2020-02-10 20:10:16,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15547 transitions. [2020-02-10 20:10:16,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:16,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:16,516 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -916510266, now seen corresponding path program 597 times [2020-02-10 20:10:16,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:16,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050397683] [2020-02-10 20:10:16,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:17,038 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:17,165 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:17,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:10:17,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050397683] [2020-02-10 20:10:17,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:17,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:17,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80976333] [2020-02-10 20:10:17,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:17,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:17,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:17,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:17,175 INFO L87 Difference]: Start difference. First operand 3123 states and 15547 transitions. Second operand 12 states. [2020-02-10 20:10:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:17,480 INFO L93 Difference]: Finished difference Result 6011 states and 26765 transitions. [2020-02-10 20:10:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:17,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:17,495 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:10:17,495 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:10:17,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:10:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3130. [2020-02-10 20:10:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:10:17,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15560 transitions. [2020-02-10 20:10:17,694 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15560 transitions. Word has length 31 [2020-02-10 20:10:17,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:17,694 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15560 transitions. [2020-02-10 20:10:17,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15560 transitions. [2020-02-10 20:10:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:17,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:17,699 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:17,699 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:17,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1266028400, now seen corresponding path program 598 times [2020-02-10 20:10:17,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:17,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044225530] [2020-02-10 20:10:17,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:18,228 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:10:18,357 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:18,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:10:18,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044225530] [2020-02-10 20:10:18,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:18,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:18,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550915766] [2020-02-10 20:10:18,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:18,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:18,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:18,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:18,368 INFO L87 Difference]: Start difference. First operand 3130 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:10:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:18,631 INFO L93 Difference]: Finished difference Result 6016 states and 26768 transitions. [2020-02-10 20:10:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:18,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:18,647 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:10:18,647 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:10:18,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:10:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3123. [2020-02-10 20:10:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:10:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15540 transitions. [2020-02-10 20:10:18,846 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15540 transitions. Word has length 31 [2020-02-10 20:10:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:18,846 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15540 transitions. [2020-02-10 20:10:18,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15540 transitions. [2020-02-10 20:10:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:18,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:18,851 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:18,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2109174342, now seen corresponding path program 599 times [2020-02-10 20:10:18,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:18,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623736643] [2020-02-10 20:10:18,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:19,392 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:19,523 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:19,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:10:19,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623736643] [2020-02-10 20:10:19,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:19,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:19,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688770210] [2020-02-10 20:10:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:19,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:19,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:19,533 INFO L87 Difference]: Start difference. First operand 3123 states and 15540 transitions. Second operand 12 states. [2020-02-10 20:10:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:19,829 INFO L93 Difference]: Finished difference Result 6014 states and 26765 transitions. [2020-02-10 20:10:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:19,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:19,846 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:10:19,846 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:10:19,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:10:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3131. [2020-02-10 20:10:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:10:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15555 transitions. [2020-02-10 20:10:20,050 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15555 transitions. Word has length 31 [2020-02-10 20:10:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:20,050 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15555 transitions. [2020-02-10 20:10:20,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15555 transitions. [2020-02-10 20:10:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:20,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:20,055 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:20,055 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash 841717164, now seen corresponding path program 600 times [2020-02-10 20:10:20,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:20,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549200874] [2020-02-10 20:10:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:20,598 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:10:20,730 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:20,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549200874] [2020-02-10 20:10:20,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:20,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:20,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299770067] [2020-02-10 20:10:20,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:20,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:20,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:20,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:20,741 INFO L87 Difference]: Start difference. First operand 3131 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:10:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:20,989 INFO L93 Difference]: Finished difference Result 6018 states and 26765 transitions. [2020-02-10 20:10:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:20,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:21,005 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:10:21,005 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:10:21,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:10:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3104. [2020-02-10 20:10:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:10:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15499 transitions. [2020-02-10 20:10:21,208 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15499 transitions. Word has length 31 [2020-02-10 20:10:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:21,208 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15499 transitions. [2020-02-10 20:10:21,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15499 transitions. [2020-02-10 20:10:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:21,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:21,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:21,214 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash 949809614, now seen corresponding path program 601 times [2020-02-10 20:10:21,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:21,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563128334] [2020-02-10 20:10:21,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:21,739 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:21,868 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:21,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563128334] [2020-02-10 20:10:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:21,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828765213] [2020-02-10 20:10:21,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:21,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:21,878 INFO L87 Difference]: Start difference. First operand 3104 states and 15499 transitions. Second operand 12 states. [2020-02-10 20:10:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:22,156 INFO L93 Difference]: Finished difference Result 5995 states and 26769 transitions. [2020-02-10 20:10:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:22,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:22,171 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:10:22,171 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:10:22,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:10:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3126. [2020-02-10 20:10:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:10:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-02-10 20:10:22,371 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-02-10 20:10:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:22,372 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-02-10 20:10:22,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-02-10 20:10:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:22,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:22,377 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:22,377 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:22,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:22,377 INFO L82 PathProgramCache]: Analyzing trace with hash 104838162, now seen corresponding path program 602 times [2020-02-10 20:10:22,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:22,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036058045] [2020-02-10 20:10:22,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:22,897 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:10:23,029 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:23,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036058045] [2020-02-10 20:10:23,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:23,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:23,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104480477] [2020-02-10 20:10:23,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:23,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:23,039 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:10:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:23,262 INFO L93 Difference]: Finished difference Result 5999 states and 26772 transitions. [2020-02-10 20:10:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:23,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:23,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:23,277 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:10:23,277 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:10:23,277 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:10:23,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 20:10:23,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:10:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15575 transitions. [2020-02-10 20:10:23,482 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15575 transitions. Word has length 31 [2020-02-10 20:10:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:23,482 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15575 transitions. [2020-02-10 20:10:23,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15575 transitions. [2020-02-10 20:10:23,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:23,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:23,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:23,488 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:23,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:23,488 INFO L82 PathProgramCache]: Analyzing trace with hash 525498378, now seen corresponding path program 603 times [2020-02-10 20:10:23,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:23,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863303648] [2020-02-10 20:10:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:24,023 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:24,152 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:10:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:24,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863303648] [2020-02-10 20:10:24,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:24,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:24,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137400976] [2020-02-10 20:10:24,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:24,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:24,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:24,162 INFO L87 Difference]: Start difference. First operand 3121 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:10:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:24,398 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-02-10 20:10:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:24,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:24,413 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:10:24,413 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:10:24,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:10:24,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-02-10 20:10:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:10:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:10:24,612 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:10:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:24,612 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:10:24,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:10:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:24,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:24,617 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1164444526, now seen corresponding path program 604 times [2020-02-10 20:10:24,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:24,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514833517] [2020-02-10 20:10:24,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:25,164 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:25,302 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:25,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:10:25,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514833517] [2020-02-10 20:10:25,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:25,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:25,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359260546] [2020-02-10 20:10:25,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:25,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:25,313 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:10:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:25,574 INFO L93 Difference]: Finished difference Result 5993 states and 26755 transitions. [2020-02-10 20:10:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:25,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:25,589 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:10:25,590 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:10:25,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:10:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3121. [2020-02-10 20:10:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:10:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:10:25,789 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:10:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:25,789 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:10:25,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:10:25,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:25,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:25,795 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash -743784310, now seen corresponding path program 605 times [2020-02-10 20:10:25,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:25,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314755281] [2020-02-10 20:10:25,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:26,313 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:10:26,444 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:26,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:10:26,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314755281] [2020-02-10 20:10:26,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:26,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:26,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687811275] [2020-02-10 20:10:26,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:26,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:26,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:26,504 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:10:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:26,777 INFO L93 Difference]: Finished difference Result 6001 states and 26772 transitions. [2020-02-10 20:10:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:26,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:26,792 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:10:26,792 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:10:26,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:10:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3127. [2020-02-10 20:10:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:10:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:10:26,992 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:10:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:26,992 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:10:26,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:10:26,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:26,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:26,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:26,998 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:26,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:26,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1588755762, now seen corresponding path program 606 times [2020-02-10 20:10:26,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:26,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072886356] [2020-02-10 20:10:26,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:27,641 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:10:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:27,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072886356] [2020-02-10 20:10:27,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:27,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:27,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528232503] [2020-02-10 20:10:27,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:27,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:27,651 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:10:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:27,940 INFO L93 Difference]: Finished difference Result 5998 states and 26760 transitions. [2020-02-10 20:10:27,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:27,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:27,956 INFO L225 Difference]: With dead ends: 5998 [2020-02-10 20:10:27,956 INFO L226 Difference]: Without dead ends: 5970 [2020-02-10 20:10:27,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2020-02-10 20:10:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 3116. [2020-02-10 20:10:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:10:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15556 transitions. [2020-02-10 20:10:28,162 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15556 transitions. Word has length 31 [2020-02-10 20:10:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:28,163 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15556 transitions. [2020-02-10 20:10:28,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15556 transitions. [2020-02-10 20:10:28,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:28,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:28,168 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash 681063186, now seen corresponding path program 607 times [2020-02-10 20:10:28,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:28,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923658812] [2020-02-10 20:10:28,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:28,685 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:28,812 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:28,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923658812] [2020-02-10 20:10:28,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:28,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:28,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236228324] [2020-02-10 20:10:28,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:28,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:28,822 INFO L87 Difference]: Start difference. First operand 3116 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:10:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:29,114 INFO L93 Difference]: Finished difference Result 5997 states and 26769 transitions. [2020-02-10 20:10:29,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:29,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:29,129 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:10:29,129 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:10:29,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:10:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3126. [2020-02-10 20:10:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:10:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:10:29,333 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:10:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:29,333 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:10:29,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:10:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:29,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:29,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:29,338 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -163908266, now seen corresponding path program 608 times [2020-02-10 20:10:29,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:29,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382983720] [2020-02-10 20:10:29,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:29,851 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2020-02-10 20:10:29,983 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:10:29,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382983720] [2020-02-10 20:10:29,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:29,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:29,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076016860] [2020-02-10 20:10:29,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:29,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:29,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:29,993 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:10:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:30,249 INFO L93 Difference]: Finished difference Result 6001 states and 26772 transitions. [2020-02-10 20:10:30,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:30,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:30,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:30,264 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:10:30,264 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:10:30,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:10:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3121. [2020-02-10 20:10:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:10:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:10:30,464 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:10:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:30,464 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:10:30,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:10:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:30,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:30,470 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash -167559286, now seen corresponding path program 609 times [2020-02-10 20:10:30,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:30,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405670571] [2020-02-10 20:10:30,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:10:30,993 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:10:31,123 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:10:31,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:10:31,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405670571] [2020-02-10 20:10:31,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:10:31,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:10:31,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591781578] [2020-02-10 20:10:31,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:10:31,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:10:31,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:10:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:10:31,133 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:10:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:10:31,423 INFO L93 Difference]: Finished difference Result 5995 states and 26760 transitions. [2020-02-10 20:10:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:10:31,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:10:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:10:31,437 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:10:31,438 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:10:31,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:10:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:10:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3126. [2020-02-10 20:10:31,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:10:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15579 transitions. [2020-02-10 20:10:31,642 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15579 transitions. Word has length 31 [2020-02-10 20:10:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:10:31,642 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15579 transitions. [2020-02-10 20:10:31,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:10:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15579 transitions. [2020-02-10 20:10:31,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:10:31,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:10:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:10:31,647 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:10:31,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:10:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1592493654, now seen corresponding path program 610 times [2020-02-10 20:10:31,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:10:31,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702137366] [2020-02-10 20:10:31,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:10:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 20:10:32,149 WARN L209 SmtUtils]: Removed 8 from assertion stack [2020-02-10 20:10:32,150 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:10:32,152 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:10:32,152 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:10:32 BasicIcfg [2020-02-10 20:10:32,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:10:32,153 INFO L168 Benchmark]: Toolchain (without parser) took 773532.73 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 119.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-02-10 20:10:32,153 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 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:10:32,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.43 ms. Allocated memory is still 137.9 MB. Free memory was 119.6 MB in the beginning and 117.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:10:32,154 INFO L168 Benchmark]: Boogie Preprocessor took 22.94 ms. Allocated memory is still 137.9 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:10:32,154 INFO L168 Benchmark]: RCFGBuilder took 362.89 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 102.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:10:32,154 INFO L168 Benchmark]: TraceAbstraction took 773103.39 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2020-02-10 20:10:32,154 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 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 37.43 ms. Allocated memory is still 137.9 MB. Free memory was 119.6 MB in the beginning and 117.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.94 ms. Allocated memory is still 137.9 MB. Free memory was 117.9 MB in the beginning and 116.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 362.89 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 102.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 773103.39 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.5s, 84 ProgramPointsBefore, 73 ProgramPointsAfterwards, 143 TransitionsBefore, 132 TransitionsAfterwards, 3780 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 990 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1035 CheckedPairsTotal, 11 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 58 for 88ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 772.7s, OverallIterations: 619, TraceHistogramMax: 1, AutomataDifference: 176.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.6s, HoareTripleCheckerStatistics: 93811 SDtfs, 140200 SDslu, 264503 SDs, 0 SdLazy, 70622 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 71.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7335 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 6708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4872 ImplicationChecksByTransitivity, 451.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60074occurred 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: 145.5s AutomataMinimizationTime, 618 MinimizatonAttempts, 1754301 StatesRemovedByMinimization, 609 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 415.8s InterpolantComputationTime, 19158 NumberOfCodeBlocks, 19158 NumberOfCodeBlocksAsserted, 618 NumberOfCheckSat, 18540 ConstructedInterpolants, 0 QuantifiedInterpolants, 23068200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 618 InterpolantComputations, 618 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 could not prove your program: Timeout Completed graceful shutdown